Alternating cycles and paths in edge-coloured multigraphs: A survey

Discrete Mathematics

Volumn 165-166, Issue , 1997, Pages 39-60

  Bang Jensen, Jørgen ^a   Gutin, Gregory ^a  

^a UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037945166     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(96)00160-4     Document Type: Article

References (55)

1. N. Alon and G. Gutin, Properly colored Hamilton cycles in edge colored complete graphs, submitted.
2. D. Amar and Y. Manoussakis, Cycles and paths of many lengths in bipartite digraphs, J. Combin. Theory Ser. B 50 (1990) 254-264.
3. J. Bang-Jensen and G. Gutin, Alternating cycles and trails in 2-edge-coloured complete multigraphs, submitted.
4. J. Bang-Jensen, G. Gutin and A. Yeo, Properly coloured Hamiltonian paths in edge-coloured graphs, submitted
5. J. Bang-Jensen and Y. Manoussakis, Weakly Hamiltonian-connected vertices in bipartite tournaments, J. Combin. Theory Ser. B 63 (1995) 261-280.
6. M. Bankfalvi and Zs. Bankfalvi, Alternating Hamiltonian circuits in two-coloured complete graphs, in: Theory of Graphs; Proc. Coll. Tihany, 1968 (Academic Press, New York, 1968) 11-18.
7. O. Barr, Properly coloured Hamiltonian paths in edge-coloured complete graphs without monochromatic triangles, Ars Combinatoria, to appear.
8. M. Behzad, G. Chartrand and L. Lesniak-Foster, Graphs and Digraphs, Int. Series, Prindle, Weber & Schmidt, Boston, MA, 1979.
9. L.W. Beineke, A tour through tournaments or bipartite and ordinary tournaments: a comparative survey, J. London Math. Soc. Lect. Notes Ser. No. 52 (1981) 41-55.
10. L.W. Beineke and C. Little, Cycles in bipartite tournaments, J. Combin. Theory Ser. B. 32 (1982) 140-145.
11. L.W. Beineke and M.D. Plummer, On the 1-factors of a nonseparable graph. J. Combin. Theory 2 (1967) 285-289.
12. A. Benkouar, Y. Manoussakis, V. Paschos and R. Saad, On the complexity of finding alternating Hamiltonian and Eulerian cycles in edge-coloured graphs, Lecture Notes in Computer Science, vol. 557 (Springer, Berlin, 1991) 190-198.
13. A. Benkouar, Y. Manoussakis and R. Saad, Alternating cycles through fixed vertices in edge-colored graphs, J. Combin. Math. Combin. Comput. 16 (1994) 199-207.
14. J.-C. Bermond and C. Thomassen, Cycles in digraphs: a survey, J. Graph Theory 5 (1981) 1-43.
15. B. Bollobás and P. Erdo″s, Alternating Hamiltonian cycles, Israel J. Math. 23 (1976) 126-131.
16. J. A. Bondy and U.R.S. Murty, Graph Theory with Applications (Macmillan, London, 1976).
17. C.C. Chen and D.E. Daykin, Graphs with Hamiltonian cycles having adjacent lines different colors. J. Combin. Theory Ser. B 21 (1976) 135-139.
18. A.G. Chetwynd and A.J.W. Hilton, Alternating Hamiltonian cycles in two colored complete bipartite graphs. J. Graph Theory 16 (1992) 153-158.
19. W.S. Chow, Y. Manoussakis, O. Megalakaki, M. Spyratos and Z. Tuza, Paths through fixed vertices in edge-colored graphs, J. des Mathematiques, Informatique et Science, Humaines 32 (1994) 49-58.
20. P. Das, Pan-alternating cyclic edge-partitioned graphs, Ars Combin. 14 (1982) 105-114.
21. P. Das and S.B. Rao, Alternating Eulerian trails with prescribed degrees in two edge-colored complete graphs, Discrete Math. 43 (1983) 9-20.
22. D.E. Daykin, Graphs with cycles having adjacent lines different colors, J. Combin. Theory Ser. B 20 (1976) 149-152.
23. D. Dorninger, On permutations of chromosomes, in: Contributions to General Algebra, vol. 5 (Verlag Hölder-Pichler-Tempsky, Wien; Teubner, Stuttgart, 1987) 95-103.
24. D. Dorninger, Hamiltonian circuits determining the order of chromosomes, Discrete Appl. Math. 50 (1994) 159-168.
25. D. Dorninger and W. Timischl, Geometrical constraints on Bennett's predictions of chromosome order, Heredity 58 (1987) 321-325.
26. 2.5)-algorithm for maximum matchings in general graphs, Proc. 16th Ann. Symp. Foundations of CS, Berkley (1975) 100-112.
27. H. Fleishner, Eulerian Graphs and Related Topics, Part I, Annals of Discrete Math., Vol. 45 (North-Holland, Amsterdam, 1990).
28. A. Ghouilà-Houri, Une condition suffisante d'existence d'un circuit Hamiltonien, C.R. Acad. Sci. Paris 156 (1960) 495-497.
29. J.W. Grossman and R. Häggkvist, Alternating cycles in edge-partitioned graphs. J. Combin. Theory Ser. B 34 (1983) 77-81.
30. G. Gutin, A criterion for complete bipartite digraphs to be Hamiltonian, Vestsi Acad. Navuk BSSR Ser. Fiz.-Mat. Navuk (1) (1984) 99-100 (in Russian)
31. G. Gutin, Effective characterization of complete bipartite digraphs that have a Hamiltonian path, Kibemetica (4) (1985) 124-125 (in Russian)
32. G. Gutin, Finding a longest path in a complete multipartite digraph, SIAM J. Discrete Math. 6 (1993) 270-273.
33. G. Gutin, Cycles and paths in semicomplete multipartite digraphs, theorems and algorithms: a survey, J. Graph Theory 19 (1995) 481-505.
34. G. Gutin, Paths and cycles in directed graphs, Ph.D. Thesis, Tel Aviv, 1993.
35. G. Gutin, Characterizations of vertex pancyclic and pancyclic ordinary complete multipartite digraphs, Discrete Math. 141 (1995) 153-162.
36. R. Häggkvist, On F-Hamiltonian graphs, Graph Theory and Related Topics (Academic Press, New York, 1979) 219-231.
37. R. Häggkvist and Y. Manoussakis, Cycles and paths in bipartite tournaments with spanning configurations, Combinatorica 9 (1989) 33-38.
38. A.J.W. Hilton, Alternating Hamiltonian circuits in edge-coloured bipartite graphs, Discrete Appl. Math. 35 (1992) 271-273.
39. B. Jackson and R.W. Whitty, A note concerning graphs with unique f-factors, J. Graph Theory 13 (1989) 557-580.
40. A. Kotzig, On the theory of finite graphs with a linear factor II, Math. Fyz. Čazopis 9 (1959) 73-91.
41. A. Kotzig, Moves without forbidden transitions in a graph, Math. Fyz. Cazopis 18 (1968) 76-80.
42. W. Mader, 1-factoren von Graphen, Math. Ann. 201 (1973) 269-282.
43. Y. Manoussakis, Alternating paths in edge-coloured complete graphs, Discrete Appl. Math. 56 (1995) 297-309.
44. Y. Manoussakis and Z. Tuza, Polynomial algorithms for finding cycles and paths in bipartite tournaments, SIAM J. Discrete Math. 3 (1990) 537-543.
45. H.M. Mulder, Julius Petersen's theory of regular graphs, Discrete Math. 100 (1992) 157-175.
46. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and complexity (Prentice-Hall, Englewood Cliffs, NJ, 1982).
47. J. Petersen, Die Theorie der regulären graphs, Acta Math. 15 (1891) 193-220.
48. R. Saad, Finding a longest alternating cycle in a 2-edge-coloured complete graph is in RP, Combinatorics, Probability and Computing 5 (1996) 297-306.
49. P.D. Seymour, Sums of circuits, Graph Theory and Related Topics (Academic Press, New York, 1987) 341-355.
50. J. Shearer, A property of the colored complete graph, Discrete Math. 25 (1979) 175-178.
51. R.E. Tarjan, Data Structures and Network Algorithms (SIAM, Philadelphia, 1983).
52. C. Whitehead, Alternating cycles in edge-colored graphs, J. Graph Theory 13 (1989) 387-391.
53. D. Woodall, Improper colourings of graphs, in: R. Nelson and R.J. Wilson, eds., Graph Colourings, Pitman Research Notes in Math. Series, vol. 218 (Longman, New York, 1990).
54. A. Yeo, Alternating cycles in edge-coloured graphs, J. Combin. Theory Ser B, to appear
55. K.M. Zhang, Vertex even-pancyclicity in bipartite tournaments, J. Nanjing Univ. Math. Biquart. 1 (1981) 85-88.