Vertex Partitions by Connected Monochromatic k-Regular Graphs

Journal of Combinatorial Theory. Series B

Volumn 78, Issue 1, 2000, Pages 115-122

  Sárközy, Gábor N ^a   Selkow, Stanley M ^a  

^a Worcester Polytechnic Institute   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (10)

1. Erdos P., Gyárfás A., Pyber L. Vertex coverings by monochromatic cycles and trees. J. Combin. Theory B. 51:1991;90-95.
2. Gyárfás A. Covering complete graphs by monochromatic paths. Irregularities of Partitions. Algorithms and Combinatorics. 8:1989;Springer-Verlag. p. 89-91.
3. Haxell P. Partitioning complete bipartite graphs by monochromatic cycles. J. Combin. Theory B. 69:1997;210-218.
4. Komlós J., Simonovits M. Szemerédi's Regularity Lemma and its applications in graph theory. Miklós D., Sós V. T., Szonyi T. Combinatorics, Paul Erdos is Eighty. Bolyai Society Mathematical Studies. 2:1996;295-352 János Bolyai Mathematical Society, Budapest.
5. Komlós J., Sárközy G. N., Szemerédi E. Blow-up Lemma. Combinatorica. 17:1997;109-123.
6. Lovász L. Combinatorial Problems and Exercices. 1979;North-Holland, Amsterdam. p. 56.
7. Luczak T., Rödl V., Szemerédi E. Partitioning two-colored complete graphs into two monochromatic cycles. Probability, Combinatorics and Computing. 7:1998;423-436.
8. Pyber L., Rödl V., Szemerédi E. Dense graphs without 3-regular subgraphs. J. Combin. Theory B. 63:1995;41-54.
9. G. N. Sárközy, Fast parallel algorithms for finding Hamiltonian cycles and trees in graphs, Technical Report, 93-81, DIMACS, Rutgers University.
10. H. Servatius, private communication.