A Proof of 4-Coloring the Edges of a Cubic Graph
From MaRDI portal
Publication:5339965
DOI10.2307/2313923zbMath0131.20805OpenAlexW2329811552MaRDI QIDQ5339965
No author found.
Publication date: 1966
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2313923
Related Items
Transformations of cubic graphs, Measures of edge-uncolorability of cubic graphs, Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44, Measurements of edge-uncolorability, 4-edge-coloring graphs of maximum degree 3 in linear time
