Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

COMBINATORICS
2007

favoriteEmaildiscussreport

55views more COMBINATORICS 2007»

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

13 years 11 months ago

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

Download www3.combinatorics.org

We prove that if G is a graph containing a doubly-critical edge and satisfying χ ≥ ∆ ≥ 6, then G contains a K∆.

Landon Rabern

Real-time Traffic

COMBINATORICS 2007 | Doubly-critical Edge |

claim paper

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2007
Where	COMBINATORICS
Authors	Landon Rabern

Comments (0)