Class I graphs of nonnegative characteristic without special cycles

DOI10.1007/s11766-012-2742-xzbMath1289.05242OpenAlexW1992394010MaRDI QIDQ377914

Danjun Huang, Wei Fan Wang

Publication date: 19 November 2013

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-012-2742-x

zbMATH Keywords

cyclecharacteristicclass I graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• On 3-colorability of planar graphs without adjacent short cycles
• Coloring edges of graphs embedded in a surface of characteristic zero.
• Edge coloring of graphs with small average degrees
• Planar graphs of maximum degree seven are Class I
• A note on graphs of class I
• A sufficient condition for a planar graph to be class I
• 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
• Every planar graph with maximum degree 7 is of class 1

This page was built for publication: Class I graphs of nonnegative characteristic without special cycles