The average degree of edge chromatic critical graphs with maximum degree seven

DOI10.1002/JGT.22933zbMath1522.05061arXiv2301.02140MaRDI QIDQ6074595

Rong Luo, Zheng-Ke Miao, Yan Cao, Yue Zhao

Publication date: 12 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

planar graphsedge coloringcritical graphsEuler formula

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
• Unnamed Item
• On critical graphs with chromatic index 4
• On the size of edge-chromatic critical graphs
• Coloring edges of graphs embedded in a surface of characteristic zero.
• Graph edge coloring: a survey
• Planar graphs of maximum degree seven are Class I
• An improvement to the Hilton-Zhao vertex-splitting conjecture
• On the average degree of edge chromatic critical graphs. II.
• On the average degree of edge chromatic critical graphs
• Finding Δ(Σ) for a Surface Σ of Characteristic −4
• Finding Δ(Σ) for a surface σ of characteristic χ(Σ) = −5
• The size of edge chromatic critical graphs with maximum degree 6
• The average degree of an edge‐chromatic critical graph II
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• Every planar graph with maximum degree 7 is of class 1

This page was built for publication: The average degree of edge chromatic critical graphs with maximum degree seven