Sciweavers

COMBINATORICS
2007

The Borodin-Kostochka Conjecture for Graphs Containing a Doubly Critical Edge

13 years 6 months ago
The Borodin-Kostochka Conjecture for Graphs Containing a Doubly Critical Edge
We prove that if G is a graph containing a doubly-critical edge and satisfying χ ≥ ∆ ≥ 6, then G contains a K∆.
Landon Rabern
Added 12 Dec 2010
Updated 12 Dec 2010
Type Journal
Year 2007
Where COMBINATORICS
Authors Landon Rabern
Comments (0)