A note on class one graphs with maximum degree six

DOI10.1016/j.disc.2006.02.007zbMath1106.05034OpenAlexW2023340534MaRDI QIDQ2497484

Xue-Chao Li, Rong Luo, Jianbing Niu

Publication date: 4 August 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.02.007

zbMATH Keywords

embeddingEuler characteristicplanaredge chromatic numberclass one

Mathematics Subject Classification ID

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

Related Items (3)

Edge coloring of graphs embedded in a surface of nonnegative characteristic ⋮ Class I graphs of nonnegative characteristic without special cycles ⋮ A sufficient condition for a planar graph to be class I

Cites Work

• Unnamed Item
• Chromatic index critical graphs of order 9
• On small graphs critical with respect to edge colourings
• Chromatic-index-critical graphs of orders 11 and 12
• Edge coloring of graphs with small average degrees
• Planar graphs of maximum degree seven are Class I
• A note on graphs of class I
• Every planar graph with maximum degree 7 is of class 1

This page was built for publication: A note on class one graphs with maximum degree six