On the maximum number of independent cycles in a bipartite graph

Journal of Combinatorial Theory. Series B

Volumn 67, Issue 1, 1996, Pages 152-164

  Wang, Hong ^a  

^a UNIVERSITY OF NEW ORLEANS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030140906     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.1996.0037     Document Type: Article

References (6)

1. 1. B. BOLLOBÁS, "Extremal Graph Theory," Academic Press, London, 1978.
2. 2. K. CORRÁDI AND A. HAJNAL, On the maximal number of independent circuits in a graph, Acta Math. Acad. Sci. Hungar. 14 (1963), 423-439.
3. 3. M. EL-ZAHAR, On circuits in graphs, Discrete Math. 50 (1984), 227-230.
4. 4. A. HAJNAL AND E. SZEMERÉDI, Proof of a conjecture of Erdös, in "Combinatorial Theory and Its Application" (P. Erdös, A. Renyi, and V. Sós, Eds.), Vol. II, pp. 601-623, Colloq. Math. Soc. J. Bolyai 4, North-Holland, Amsterdam, 1970.
5. 5. L. LESNIAK, Independent cycles in graphs, JCMCC 17 (1995), 55-63.
6. 6. H. WANG, Independent cycles with limited size in a graph, 10 (1994), 271-281.