Planar graphs of maximum degree six without 7-cycles are class one

MaRDI QIDQ456339zbMATH OpenFDO

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

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

class onecycleedge coloringplanar graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Review text

Summary: In this paper, we prove that every planar graph of maximum degree six without 7-cycles is class one.

Cited in

(6)

• Graph edge coloring: a survey
• A survey on the cyclic coloring and its relaxations
• Edge coloring of graphs embedded in a surface of nonnegative characteristic
• Some sufficient conditions for a planar graph of maximum degree six to be Class 1
• A note on class one graphs with maximum degree six
• Facial rainbow edge-coloring of simple 3-connected plane graphs

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)