Alternating Hamiltonian circuits in edge-coloured bipartite graphs
From MaRDI portal
Publication:1186314
DOI10.1016/0166-218X(92)90249-AzbMath0751.05066OpenAlexW1989594226MaRDI QIDQ1186314
Publication date: 28 June 1992
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(92)90249-a
Related Items (5)
Alternating cycles and paths in edge-coloured multigraphs: A survey ⋮ Alternating kernels ⋮ Unnamed Item ⋮ A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs ⋮ The total chromatic number of regular graphs whose complement is bipartite
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Alternating cycles in edge-partitioned graphs
- Graphs with cycles having adjacent lines different colors
- Alternating Hamiltonian cycles
- Graphs with Hamiltonian cycles having adjacent lines different colours
- Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente
This page was built for publication: Alternating Hamiltonian circuits in edge-coloured bipartite graphs