A new upper bound for the independence number of edge chromatic critical graphs
- 16 December 2010
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 68 (3) , 202-212
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- An application of Vizing and Vizing-like adjacency lemmas to Vizing’s Independence Number Conjecture of edge chromatic critical graphsDiscrete Mathematics, 2009
- The size of edge chromatic critical graphs with maximum degree 6Journal of Graph Theory, 2008
- A note on Vizing's independence number conjecture of edge chromatic critical graphsDiscrete Mathematics, 2006
- Independent sets and 2‐factors in edge‐chromatic‐critical graphsJournal of Graph Theory, 2003
- Planar Graphs of Maximum Degree Seven are Class IJournal of Combinatorial Theory, Series B, 2001
- Bounds for the Independence Number of Critical GraphsBulletin of the London Mathematical Society, 2000