Pages that link to "Item:Q4487665"
From MaRDI portal
The following pages link to Bounds for the Independence Number of Critical Graphs (Q4487665):
Displayed 9 items.
- An application of Vizing and Vizing-like adjacency lemmas to Vizing's independence number conjecture of edge chromatic critical graphs (Q1043651) (← links)
- Vizing's 2-factor conjecture involving toughness and maximum degree conditions (Q2415079) (← links)
- A note on Vizing's independence number conjecture of edge chromatic critical graphs (Q2502907) (← links)
- On the independence number of edge chromatic critical graphs (Q2509546) (← links)
- The independence number of an edge-chromatic critical graph (Q3081307) (← links)
- A new upper bound for the independence number of edge chromatic critical graphs (Q3096957) (← links)
- Approximating Vizing's independence number conjecture (Q4616100) (← links)
- REMARKS ON EDGE CRITICAL GRAPHS WITH MAXIMUM DEGREE OF 3 AND 4 (Q5076249) (← links)
- Independence number of edge‐chromatic critical graphs (Q6081590) (← links)