Alternating hamiltonian cycles in two colored complete bipartite graphs
From MaRDI portal
Publication:4013417
DOI10.1002/JGT.3190160206zbMATH Open0760.05036OpenAlexW2086704802WikidataQ59233590 ScholiaQ59233590MaRDI QIDQ4013417FDOQ4013417
Amanda G. Chetwynd, A. J. W. Hilton
Publication date: 27 September 1992
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190160206
Recommendations
Cited In (13)
- Alternating Hamiltonian cycles
- An Improvement of Hind's Upper Bound on the Total Chromatic Number
- Title not available (Why is that?)
- Title not available (Why is that?)
- Alternating cycles and paths in edge-coloured multigraphs: A survey
- Title not available (Why is that?)
- On supereulerian 2-edge-coloured graphs
- Alternating Hamiltonian circuits in edge-coloured bipartite graphs
- Hamiltonicity in vertex envelopes of plane cubic graphs
- Dynamic cycles in edge-colored multigraphs
- Title not available (Why is that?)
- The number of 2-edge-colored complete graphs with unique Hamiltonian alternating cycle
- Note on alternating directed cycles
This page was built for publication: Alternating hamiltonian cycles in two colored complete bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4013417)