The average degree of an edge-chromatic critical graph

DOI10.1016/j.disc.2007.07.048zbMath1133.05035OpenAlexW2094483376MaRDI QIDQ2470447

Douglas R. Woodall

Publication date: 14 February 2008

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

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

zbMATH Keywords

lower boundsedge colouringaverage degreeedge-critical graphadjacency lemma

Mathematics Subject Classification ID

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

Related Items

Face-degree bounds for planar critical graphs, REMARKS ON EDGE CRITICAL GRAPHS WITH MAXIMUM DEGREE OF 3 AND 4, Lower bounds on the number of edges in edge-chromatic-critical graphs with fixed maximum degrees, Double Vizing fans in critical class two graphs, On the average degree of critical graphs with maximum degree six, Remarks on planar edge-chromatic critical graphs, Average degrees of edge-chromatic critical graphs, The average degree of a multigraph critical with respect to edge or total choosability, The spectral radius of edge chromatic critical graphs

Cites Work

• On graphs critical with respect to edge-colourings
• On critical graphs with chromatic index 4
• On the size of edge-chromatic critical graphs
• Remarks on the size of critical edge-chromatic graphs
• On the size of edge chromatic critical graphs
• Edge coloring of graphs with small average degrees
• Some remarks on the chromatic index of a graph
• The rise and fall of the critical graph conjecture
• On the critical graph conjecture
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item