Cycles of Given Color Patterns

Journal of Graph Theory

Volumn 21, Issue 2, 1996, Pages 153-162

  Manoussakis, Y ^a   Spyratos, M ^b   Tuza, Zs ^c  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b UNIVERSITÉ PARIS EST CRÉTEIL   (France)

^c INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030543921     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199602)21:2<153::AID-JGT4>3.0.CO;2-Q     Document Type: Article

References (14)

1. M. Bánkfalvi and Z. Bánkfalvi, Alternating hamiltonian circuits in 2-colored complete graphs, in: Theory of Graphs, Akadémiai Kiadó, Budapest (1968), 11-18.
2. E. Bampis, Y. Manoussakis, and Y. Milis, NC algorithms for finding alternating cycles in edge-colored complete graphs, submitted.
3. A. Benkouar, Y. Manoussakis, V. Paschos, and R. Saad, On the Complexity of Hamiltonian and Eulerian Problems in Edge-colored Complete Graphs, Lecture Notes in Computer Sciences, Springer Verlang (W. L. Hsu and R. C. T. Lee Editors) 557 (1991), 190-198, to appear in RAIRO.
4. A. Benkouar, Y. Manoussakis, and R. Saad, Alternating cycles through given vertices in edge-colored graphs, J. Combinatorial Math. Combinatorial Comput. 16 (1994), 199-207.
5. A. Benkouar, Y. Manoussakis, and R. Saad, Edge-colored Complete Graphs Containing Hamiltonian Cycles, submitted.
6. A. Bialostocki and P. Dierker, On simple hamiltonian cycles in a 2-colored complete graph, Ars Combinatoria 32 (1991), 13-16.
7. B. Bollobás and P. Erdös, Alternating hamiltonian cycles, Israel J. Math. 23 (1976), 126-130.
8. C. C. Chen and D. E. Daykin, Graphs with hamiltonian cycles having adjacent lines of different colors, J. Combinatorial Theory (B) 21 (1976), 135-139.
9. W. S. Chou, Y. Manoussakis, O. Megalakaki, M. Spyratos, and Zs. Tuza, Alternating paths through given vertices in edge-colored graphs, Mathématiques, Informatique et Sciences Humaines, 32 (1994), 49-58.
10. A. Gyárfás, Vertex coverings by monochromatic paths and cycles, J. Graph Theory 7 (1983), 131-135.
11. P. Hell, Y. Manoussakis, and Zs. Tuza, Packing problems in edge-colored complete graphs, Discrete Appl. Math. 14 (1994), 295-306.
12. Y. Manoussakis, Alternating paths in edge-colored complete graphs, Discrete Appl. Math. 56 (1995), 297-309.
13. H. Raynaud, Sur le circuit hamiltonien bi-colore dans les graphes orientés, Periodica Math. Hung. 3 (1973), 289-297.
14. D. Seinsche, On a Property of the Class of n-colorable Graphs, J. Combinatorial Theory (B) 16 (1974), 191-193.