The average degree of an edge‐chromatic critical graph II

DOI10.1002/JGT.20259zbMATH Open1137.05037OpenAlexW4248963349MaRDI QIDQ5434254

Douglas R. Woodall

Publication date: 4 January 2008

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20259

zbMATH Keywords

edge colouringedge-critical graph

Mathematics Subject Classification ID

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

Related Items (18)

A note on the size of edge-chromatic 4-critical graphs ⋮ Title not available (Why is that?) ⋮ Fractional matchings, component-factors and edge-chromatic critical graphs ⋮ On the size of critical graphs with small maximum degree ⋮ Hamiltonicity of edge-chromatic critical graphs ⋮ Lower bounds on the number of edges in edge-chromatic-critical graphs with fixed maximum degrees ⋮ Double Vizing fans in critical class two graphs ⋮ The average degree of edge chromatic critical graphs with maximum degree seven ⋮ On the average degree of edge chromatic critical graphs ⋮ Graph edge coloring: a survey ⋮ An introduction to the discharging method via graph coloring ⋮ The average degree of an edge-chromatic critical graph ⋮ Average degrees of edge-chromatic critical graphs ⋮ The average degree of a multigraph critical with respect to edge or total choosability ⋮ On the size of critical graphs with maximum degree 8 ⋮ On the independence number of edge chromatic critical graphs ⋮ The spectral radius of edge chromatic critical graphs ⋮ The independence number of an edge-chromatic critical graph

This page was built for publication: The average degree of an edge‐chromatic critical graph II

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