Bounds for the Independence Number of Critical Graphs
From MaRDI portal
Publication:4487665
Recommendations
- A new upper bound for the independence number of edge chromatic critical graphs
- On the independence number of edge chromatic critical graphs
- On the independence number of edge chromatic critical graphs.
- A note on Vizing's independence number conjecture of edge chromatic critical graphs
- An application of Vizing and Vizing-like adjacency lemmas to Vizing's independence number conjecture of edge chromatic critical graphs
Cited in
(18)- Critical independent sets and König-Egerváry graphs
- Independence number of edge‐chromatic critical graphs
- An application of Vizing and Vizing-like adjacency lemmas to Vizing's independence number conjecture of edge chromatic critical graphs
- scientific article; zbMATH DE number 4122024 (Why is no real title available?)
- Color-critical graphs with independent cutset
- On the independence number of edge chromatic critical graphs
- A note on graphs contraction-critical with respect to independence number
- Approximating Vizing's independence number conjecture
- Vizing's 2-factor conjecture involving toughness and maximum degree conditions
- REMARKS ON EDGE CRITICAL GRAPHS WITH MAXIMUM DEGREE OF 3 AND 4
- A note on Vizing's independence number conjecture of edge chromatic critical graphs
- The critical independence number and an independence decomposition
- A new upper bound for the independence number of edge chromatic critical graphs
- The independence number of an edge-chromatic critical graph
- On \(k\)-independence critical graphs
- On a problem concerning ordered colourings
- Independent sets and 2‐factors in edge‐chromatic‐critical graphs
- scientific article; zbMATH DE number 5912077 (Why is no real title available?)
This page was built for publication: Bounds for the Independence Number of Critical Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4487665)