The independence number of an edge-chromatic critical graph

DOI10.1002/jgt.20493zbMath1216.05040OpenAlexW2140035746MaRDI QIDQ3081307

Douglas R. Woodall

Publication date: 7 March 2011

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

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

zbMATH Keywords

edge coloringchromatic indexedge-critical graphadjacency lemma

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (7)

REMARKS ON EDGE CRITICAL GRAPHS WITH MAXIMUM DEGREE OF 3 AND 4 ⋮ Fractional matchings, component-factors and edge-chromatic critical graphs ⋮ Vizing's 2-factor conjecture involving toughness and maximum degree conditions ⋮ Independence number of edge‐chromatic critical graphs ⋮ Graph edge coloring: a survey ⋮ On the independence number of edge chromatic critical graphs ⋮ Approximating Vizing's independence number conjecture

Cites Work

• An application of Vizing and Vizing-like adjacency lemmas to Vizing's independence number conjecture of edge chromatic critical graphs
• A note on Vizing's independence number conjecture of edge chromatic critical graphs
• Independent sets and 2‐factors in edge‐chromatic‐critical graphs
• Bounds for the Independence Number of Critical Graphs
• The average degree of an edge‐chromatic critical graph II
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY

This page was built for publication: The independence number of an edge-chromatic critical graph