On the size of critical graphs with small maximum degree

DOI10.1080/00207160.2014.883068zbMath1306.05070OpenAlexW2044498194MaRDI QIDQ2931953

Wen Yao Song, Lian-Ying Miao, Shi-you Pang, Zheng-Ke Miao

Publication date: 28 November 2014

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2014.883068

zbMATH Keywords

edge coloringaverage degreecritical graph

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Sizes of critical graphs with small maximum degrees
• Edge coloring of graphs with small maximum degrees
• On the size of edge-chromatic critical graphs
• Remarks on the size of critical edge-chromatic graphs
• The size of edge chromatic critical graphs with maximum degree 6
• Some remarks on a paper by Vizing on critical graphs
• New lower bounds for the size of edge chromatic critical graphs
• The average degree of an edge‐chromatic critical graph II
• Every planar graph with maximum degree 7 is of class 1

Related Items (1)

Lower bounds on the number of edges in edge-chromatic-critical graphs with fixed maximum degrees

This page was built for publication: On the size of critical graphs with small maximum degree