A new upper bound for the independence number of edge chromatic critical graphs
From MaRDI portal
Publication:3096957
DOI10.1002/jgt.20552zbMath1229.05221OpenAlexW2135924413MaRDI QIDQ3096957
Publication date: 15 November 2011
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20552
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (3)
Vizing's 2-factor conjecture involving toughness and maximum degree conditions ⋮ 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
- Planar graphs of maximum degree seven are Class I
- A note on Vizing's independence number conjecture of edge chromatic critical graphs
- The size of edge chromatic critical graphs with maximum degree 6
- Independent sets and 2‐factors in edge‐chromatic‐critical graphs
- Bounds for the Independence Number of Critical Graphs
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
This page was built for publication: A new upper bound for the independence number of edge chromatic critical graphs
