On quadrilaterals in a graph

Discrete Mathematics

Volumn 203, Issue 1-3, 1999, Pages 229-237

  Randerath, Bert ^a   Schiermeyer, Ingo ^b   Wang, Hong ^c  

^a UNIVERSITY OF COLOGNE   (Germany)

^b BRANDENBURG UNIVERSITY OF TECHNOLOGY   (Germany)

^c UNIVERSITY OF IDAHO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038621211     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(99)00053-9     Document Type: Article

References (7)

1. Noga Alon, Raphael Yuster, H-factors in dense graphs, J. Combin. Theory, Series B 66 (1996) 269-282.
2. B. Bollobás, Extremal Graph Theory, Academic Press, London, 1978.
3. K. Corrádi, A. Hajnal, On the maximal number of independent circuits in a graph, Acta Math. Acad. Sci. Hungar. 14 (1963) 423-439.
4. P. Erdos, Some recent combinatroial problems, Technical Report, University of Bielefeld, November 1990.
5. A. Hajnal, E. Szemerédi, Proof of a conjecture of Erdos, in: P. Erdos, A. Renyi, V. Sós (Eds.), Combinatorial Theory and its Application, vol. II, Colloq. Math. Soc. J. Bolyai 4, North-Holland, Amsterdam, 1970, pp. 601-623.
6. H. Wang, Independent cycles with limited size in a graph, Graphs Combin. 10 (1994) 271-281.
7. H. Wang, On the maximum number of independent cycles in a bipartite graph, J. Combin. Theory, Ser. B 67 (1996) 152-164.