Maximal and maximum independent sets in graphs with at most r cycles

Journal of Graph Theory

Volumn 53, Issue 4, 2006, Pages 283-314

  Sagan, Bruce E ^a   Vatter, Vincent R ^b  

^a MICHIGAN STATE UNIVERSITY   (United States)

^b UNIVERSITY OF ST ANDREWS   (United Kingdom)

Author keywords

Cycle; Ear decomposition; Maximal and maximum independent set

Indexed keywords

OPTIMIZATION; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

EAR DECOMPOSITION; INDEPENDENT SET; R CYCLES; VERTICES;

GRAPH THEORY;

EID: 33845583457     PISSN: 03649024     EISSN: 10970118     Source Type: Journal    
DOI: 10.1002/jgt.20186     Document Type: Article

References (10)

1. R. Diestel, Graph Theory, Graduate Texts in Mathematics, Vol. 173, Springer-Verlag, New York, NY, 1997.
2. C. Y. Goh, K. M. Koh, B. E. Sagan, and V. R. Vatter, Maximal independent sets in graphs with at most r cycles, J Graph Theory 2006, DOI 10.1002/jgt.20185.
3. J. R. Griggs, C. M. Grinstead, and D. R. Guichard, The number of maximal independent sets in a connected graph, Discrete Math 68 (1988), 211-220.
4. M. J. Jou and G. J. Chang, The number of maximum independent sets in graphs, Taiwanese J Math 4 (2000), 685-695.
5. J. W. Moon and L. Moser, On cliques in graphs, Isr J Math 3 (1965), 23-28.
6. B. E. Sagan, A note on independent sets in trees, SIAM J Discrete Math 1 (1988), 105-108.
7. H. S. Wilf, The number of maximal independent sets in a tree, SIAM J Alg Discrete Methods 7 (1986), 125-130.
8. D. West, Introduction to Graph Theory (2nd ed.), Prentice Hall, Upper Saddle River, NJ, 2001.
9. H. Whitney, Congruent graphs and the connectivity of graphs, Am J Math 54 (1932), 150-168.
10. J. Zito, The structure and maximum number of maximum independent sets in trees, J Graph Theory 15 (1991), 207-221.