Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable

DOI10.1002/jgt.3190060218zbMath0495.05025OpenAlexW2142184171WikidataQ56621590 ScholiaQ56621590MaRDI QIDQ3958483

Andrew G. Thomason

Publication date: 1982

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190060218

zbMATH Keywords

edge coloringgeneralized Petersen graph

Mathematics Subject Classification ID

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

Related Items

On purely tree-colorable planar graphs, Hamilton weights and Petersen minors, Switching 3-edge-colorings of cubic graphs, Unnamed Item, Hamiltonian cycles and 1-factors in 5-regular graphs, Enumeration of Hamiltonian cycles in certain generalized Petersen graphs, Lower bound on the number of Hamiltonian cycles of generalized Petersen graphs, Unnamed Item, List edge colourings of some 1-factorable multigraphs

Cites Work

• Hamiltonian Cycles and Uniquely Edge Colourable Graphs
• Uniquely Line Colorable Graphs