On the size of critical graphs with maximum degree 8

DOI10.1016/J.DISC.2010.04.010MaRDI QIDQ982631zbMATH OpenOpenAlexFDO

Authors Qingbo Sun, Lianying Miao

Publication date 7 July 2010

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

average degreecritical graphedge chromatic number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites work

• Edge coloring of graphs with small average degrees
• Edge coloring of graphs with small maximum degrees
• Every planar graph with maximum degree 7 is of class 1
• scientific article; zbMATH DE number 3654142 (Why is no real title available?)
• scientific article; zbMATH DE number 3284071 (Why is no real title available?)
• New lower bounds for the size of edge chromatic critical graphs
• On critical graphs with chromatic index 4
• On the size of edge-chromatic critical graphs
• Planar graphs of maximum degree seven are Class I
• Remarks on the size of critical edge-chromatic graphs
• Sizes of critical graphs with small maximum degrees
• Some remarks on a paper by Vizing on critical graphs
• The average degree of an edge‐chromatic critical graph II
• The size of edge chromatic critical graphs with maximum degree 6

Cited in

(2)

• An introduction to the discharging method via graph coloring
• scientific article; zbMATH DE number 6290679 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q982631)