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

DOI10.1016/j.disc.2014.06.017zbMath1298.05126OpenAlexW2063542632MaRDI QIDQ396727

Bing Wei, Xue-Chao Li

Publication date: 14 August 2014

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

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

zbMATH Keywords

critical graphedge chromatic number

Mathematics Subject Classification ID

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

Related Items

REMARKS ON EDGE CRITICAL GRAPHS WITH MAXIMUM DEGREE OF 3 AND 4, Domination game critical graphs, Graph edge coloring: a survey, Rainbow vertex-connection and graph products

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Edge coloring of graphs with small maximum degrees
• On small graphs critical with respect to edge colourings
• Chromatic-index-critical graphs of orders 11 and 12
• 3- and 4-critical graphs of small even order
• Coloring edges of graphs embedded in a surface of characteristic zero.
• Planar graphs of maximum degree seven are Class I
• The average degree of an edge-chromatic critical graph
• Chromatic-index-critical graphs of orders 13 and 14
• On the size of critical graphs with small maximum degree
• The size of edge chromatic critical graphs with maximum degree 6
• The average degree of an edge‐chromatic critical graph II
• Every planar graph with maximum degree 7 is of class 1