2-factors in dense bipartite graphs

Discrete Mathematics

Volumn 257, Issue 2-3, 2002, Pages 357-369

  Czygrinow, A ^a   Kierstead, H A ^a  

^a ARIZONA STATE UNIVERSITY   (United States)

Author keywords

Bipartite graphs; Blow up lemma; Cycles

Indexed keywords

EID: 33750997637     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(02)00435-1     Document Type: Article

References (9)

1. M. Aigner, S. Brandt, Embedding arbitrary graphs of maximum degree two, J. London Math. Soc. 48 (1993) 39-51.
2. J.A. Bondy, V. Chvátal, A method in graph theory, Discrete Math. 15 (1976) 111-135.
3. H.A. Kierstead, G. Fan, Hamiltonian square paths, J. Combin. Theory B 63 (1995) 55-64.
4. J. Komlós, G.N. Sarkozy, E. Szemerédi, On the square of a hamiltonian cycle in a dense graph, in: Proceedings of the Seventh International Conference on Random Structures and Algorithms, Random Structures and Algorithms, Vol. 9, 1996, pp. 193-211.
5. J. Komlós, G.N. Sarkozy, E. Szemerédi, Blow-up lemma, Combinatorica 17(1) (1997) 109-123.
6. J. Komlós, M. Simonovits, Szemerédi's regularity lemma and its applications in graph theory, in: Combinatorics, Paul Erdos is Eighty, Vol. 2, Keszthely, 1993,
7. Bolyai Soc. Math. Stud. 2, János Bolyai Math. Soc., Budapest, 1996, pp. 295-352.
8. E. Szemerédi, Regular partitions of graphs, in: Problèmes combinatories et théorie des graphes, Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976, CNRS, Paris, 1978, pp. 399-401.
9. H. Wang, On 2-factors of a bipartite graph, J. Graph Theory 31 (1999) 101-106.