An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree

DOI10.1016/S0012-365X(03)00290-5zbMATH Open1032.05054MaRDI QIDQ1408892FDOQ1408892

Authors Shi-you Pang, Lianying Miao, Jian-Liang Wu

Publication date 25 September 2003

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

critical graphedge coloringedge chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Edge-coloring critical graphs with high degree
• On the average degree of edge chromatic critical graphs. II.
• On the size of critical graphs with small maximum degree
• New lower bounds on the number of edges of critical graphs
• On the size of edge-coloring critical graphs with maximum degree 4

Cites work

• scientific article; zbMATH DE number 3943825 (Why is no real title available?)
• scientific article; zbMATH DE number 3654142 (Why is no real title available?)
• Coloring edges of embedded graphs
• Edge-coloring critical graphs with high degree
• On graphs critical with respect to edge-colourings
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY

Cited in

(6)

• On the number of edges in hypergraphs critical with respect to strong colourings
• scientific article; zbMATH DE number 5613296 (Why is no real title available?)
• Edge-coloring critical graphs with high degree
• Graphs with large maximum degree containing no edge-critical graphs
• On the size of edge-coloring critical graphs with maximum degree 4
• scientific article; zbMATH DE number 6290679 (Why is no real title available?)

This page was built for publication: An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree

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