Alternating Hamiltonian circuits in edge-coloured bipartite graphs

DOI10.1016/0166-218X(92)90249-AzbMath0751.05066OpenAlexW1989594226MaRDI QIDQ1186314

Anthony J. W. Hilton

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

zbMATH Keywords

edge-colouringHamiltonian circuit

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)

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