Uniquely Line Colorable Graphs

DOI10.4153/CMB-1973-086-2MaRDI QIDQ5183520zbMATH OpenFDO

Authors Donald L. Greenwell, H. V. Kronk

Publication date 1973

Published in Canadian Mathematical Bulletin (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/CMB-1973-086-2

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35)

Cited in

(11)

• Un grafo cubico, non-planare, unicamente tricolorabile, di vita 5
• Uniquely total colorable graphs
• Nowhere-zero flows on signed regular graphs
• On purely tree-colorable planar graphs
• scientific article; zbMATH DE number 3966100 (Why is no real title available?)
• Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable
• A bibliographic survey of edge‐colorings
• Hamilton weights and Petersen minors
• Hamiltonian weights and unique 3‐edge‐colorings of cubic graphs
• Enumeration of Hamiltonian cycles in certain generalized Petersen graphs
• Enumeration algorithm for the edge coloring problem on bipartite graphs

This page was built for publication: Uniquely Line Colorable Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5183520)