On the average degree of critical graphs with maximum degree six

DOI10.1016/J.DISC.2011.06.029zbMath1238.05147OpenAlexW2162026130MaRDI QIDQ409377

Jibin Qu, Qingbo Sun, Lian-Ying Miao

Publication date: 13 April 2012

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

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

zbMATH Keywords

average degreecritical graphedge chromatic number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items (2)

Graph edge coloring: a survey ⋮ The spectral radius of edge chromatic critical graphs

Cites Work

• Unnamed Item
• On critical graphs with chromatic index 4
• On small graphs critical with respect to edge colourings
• On the size of edge-chromatic critical graphs
• Planar graphs of maximum degree seven are Class I
• The average degree of an edge-chromatic critical graph
• The size of edge chromatic critical graphs with maximum degree 6
• Every planar graph with maximum degree 7 is of class 1

This page was built for publication: On the average degree of critical graphs with maximum degree six