Alternating cycles and paths in edge-coloured multigraphs: A survey
- 1 March 1997
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 165-166, 39-60
- https://doi.org/10.1016/s0012-365x(96)00160-4
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- A tour through tournaments or bipartite and ordinary tournaments: a comparative surveyPublished by Cambridge University Press (CUP) ,2010
- Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a surveyJournal of Graph Theory, 1995
- Alternating paths in edge-colored complete graphsDiscrete Applied Mathematics, 1995
- Hamiltonian circuits determining the order of chromosomesDiscrete Applied Mathematics, 1994
- Alternating hamiltonian cycles in two colored complete bipartite graphsJournal of Graph Theory, 1992
- A note concerning graphs with unique f-factorsJournal of Graph Theory, 1989
- Alternating cycles in edge-colored graphsJournal of Graph Theory, 1989
- Geometrical constraints on Bennett's predictions of chromosome orderHeredity, 1987
- Cycles in digraphs– a surveyJournal of Graph Theory, 1981
- A property of the colored complete graphDiscrete Mathematics, 1979