Face-degree bounds for planar critical graphs

zbMath1344.05052arXiv1501.00869MaRDI QIDQ311518

Eckhard Steffen, Li-Gang Jin, Ying-Li Kang

Publication date: 13 September 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1501.00869

zbMATH Keywords

edge coloringcritical graphsplanar graphVizing's planar graph conjecture

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• On critical graphs with chromatic index 4
• A sufficient condition for a plane graph with maximum degree 6 to be class 1
• 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
• The average degree of an edge-chromatic critical graph
• Some sufficient conditions for a planar graph of maximum degree six to be Class 1
• The size of edge chromatic critical graphs with maximum degree 6
• Subcubic Edge‐Chromatic Critical Graphs Have Many Edges
• Every planar graph with maximum degree 7 is of class 1

This page was built for publication: Face-degree bounds for planar critical graphs