Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results
RAIRO - Operations Research - Recherche Opérationnelle, Tome 30 (1996) no. 4, pp. 417-438. 
@article{RO_1996__30_4_417_0,
     author = {Benkouar, A. and Manoussakis, Y. and Paschos, V. Th. and Saad, R.},
     title = {Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {417--438},
     publisher = {EDP-Sciences},
     volume = {30},
     number = {4},
     year = {1996},
     mrnumber = {1427450},
     zbl = {0868.90128},
     language = {en},
     url = {http://archive.numdam.org/item/RO_1996__30_4_417_0/}
}
TY  - JOUR
AU  - Benkouar, A.
AU  - Manoussakis, Y.
AU  - Paschos, V. Th.
AU  - Saad, R.
TI  - Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 1996
SP  - 417
EP  - 438
VL  - 30
IS  - 4
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/RO_1996__30_4_417_0/
LA  - en
ID  - RO_1996__30_4_417_0
ER  - 
%0 Journal Article
%A Benkouar, A.
%A Manoussakis, Y.
%A Paschos, V. Th.
%A Saad, R.
%T Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 1996
%P 417-438
%V 30
%N 4
%I EDP-Sciences
%U http://archive.numdam.org/item/RO_1996__30_4_417_0/
%G en
%F RO_1996__30_4_417_0
Benkouar, A.; Manoussakis, Y.; Paschos, V. Th.; Saad, R. Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results. RAIRO - Operations Research - Recherche Opérationnelle, Tome 30 (1996) no. 4, pp. 417-438. http://archive.numdam.org/item/RO_1996__30_4_417_0/

1. M. Bánkfalvi and Z. Bánkfalvi, Alternating Hamiltonian Circuit in Two-Colored Complete Graphs, Theory of Graphs, Proc. Colloq. Tihany, Academic Press, New York, 1968, pp. 11-18. | MR | Zbl

2. A. Benkouar, Y. Manoussakis and R. Saad, Alternating Cycles through Given Vertices in Edge-Colored Complete Graphs, to appear in J. of Comb. Comput. and Comb. Maths. | Zbl

3. A. Benkouar, Y. Manoussakis and R. Saad, Edge-Colored Complete Graphs Containing Alternating Hamiltonian Cycles, submitted.

4. B. Bollobas and P. Erdös, Alternating Hamiltonian Cycles, Israël Journal of Mathematics, 1976, 23, pp. 126-131. | MR | Zbl

5. A. Bondy and U. S. R. Murty, Graph Theory with Applications, McMillan Press, 1976.

6. C. C. Chen and D. E. Daykin, Graphs with Hamiltonian Cycles having Adjacent Lines Different Colors, J. Combinatorial Theory (B), 1976, 21, pp. 135-139. | MR | Zbl

7. S. Even and O. Kariv, An O (n2.5) algorithm for Maximum Matching in General Graphs, Proc. 16th FOCS, 1975, pp. 100-112. | MR

8. H. Fleishner, Eulerian Graphs and Related Topics, Series Book of the Annals of Discrete Mathematics, North-Holland, 1990. | Zbl

9. S. Fortune, J. Hopcroft and J. Wyllie, The Directed Subgraph Homeomorphism Problem, Theoretical Computer Science, 1980, 10, pp. 111-121. | MR | Zbl

10. M. R. Garey and D. S. Johnson, Computers and Intractability. A Guide to the Theory of NP-Completeness, Freeman, New York, 1979. | MR | Zbl

11. P. Hell, Y. Manoussakis and Zs. Tuza, Packing Problems in Edge Colored Complete Graphs, to appear in Discrete Applied Mathematics, 1994. | MR | Zbl

12. Y. Manoussakis, A Linear Algorithm for Finding Hamiltonian Cycles in Tournaments, Discrete Applied Mathematics, 1992, 36(2), pp. 199-201. | MR | Zbl

13. Y. Manoussakis, Alternating Paths in Edge-Colored Complete Graphs, to appear in Discrete Applied Mathematics, 1994. | MR | Zbl

14. Y. Manoussakis, O. Megalakaki, M. Spyratos, Wun-Seng Chou and Z. Tuza, Alternating Paths Through Given Vertices in Edge-Colored Graphs, submitted. | Numdam | Zbl

15. Y. Manoussakis, M. Spyratos and Z. Tuza, Cycles and Paths with Given Color Patterns, submitted.

16. Y. Manoussakis and Z. Tuza, Polynomial Algorithms for Finding Cycles and Paths in Bipartite Tournaments, SIAM J. on Discrete Mathematics, 1990, 3, pp. 537-543. | MR | Zbl