Planar graphs of maximum degree six without 7-cycles are class one
zbMATH Open1252.05063MaRDI QIDQ456339FDOQ456339
Authors: Danjun Huang, Weifan Wang 
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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cited In (6)
- A survey on the cyclic coloring and its relaxations
- Facial rainbow edge-coloring of simple 3-connected plane graphs
- A note on class one graphs with maximum degree six
- Edge coloring of graphs embedded in a surface of nonnegative characteristic
- Graph edge coloring: a survey
- Some sufficient conditions for a planar graph of maximum degree six to be Class 1
This page was built for publication: Planar graphs of maximum degree six without 7-cycles are class one
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456339)
