Planar graphs of maximum degree six without 7-cycles are class one
From MaRDI portal
Publication:456339
zbMath1252.05063MaRDI QIDQ456339
Publication date: 24 October 2012
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v19i3p17
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items
Edge coloring of graphs embedded in a surface of nonnegative characteristic ⋮ A survey on the cyclic coloring and its relaxations ⋮ Facial rainbow edge-coloring of simple 3-connected plane graphs ⋮ Graph edge coloring: a survey