A New Method for Enumerating Independent Sets of a Fixed Size in General Graphs

Publisher： John Wiley & Sons Inc

E-ISSN： 1097-0118|81|1|57-72

ISSN： 0364-9024

Source： JOURNAL OF GRAPH THEORY, Vol.81, Iss.1, 2016-01, pp. : 57-72

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On independent sets in random graphs

By  

RANDOM STRUCTURES AND ALGORITHMS, Vol. 47, Iss. 3, 2015-10 ,pp. : 436-486

John Wiley & Sons Inc

Access to resources Recommend Favorite

Approximation Algorithms for Independent Sets in Map Graphs

By Chen Z-Z.  

Journal of Algorithms, Vol. 41, Iss. 1, 2001-10 ,pp. : 20-40

Academic Press

Access to resources Recommend Favorite

On the number of independent sets in the trees of a fixed diameter

By Dainyak A.  

Journal of Applied and Industrial Mathematics, Vol. 4, Iss. 2, 2010-04 ,pp. : 163-171

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Coloring graphs from random lists of fixed size

By  

RANDOM STRUCTURES AND ALGORITHMS, Vol. 44, Iss. 3, 2014-05 ,pp. : 317-327

John Wiley & Sons Inc

Access to resources Recommend Favorite

Independent sets in the graphs with bounded minors of the extended incidence matrix

By Alekseev V.   Zakharova D.  

Journal of Applied and Industrial Mathematics, Vol. 5, Iss. 1, 2011-01 ,pp. : 14-18

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite