2 search results - page 1 / 1 » The Borodin-Kostochka Conjecture for Graphs Containing a Dou... |
COMBINATORICS
2007
13 years 6 months ago
2007
We prove that if G is a graph containing a doubly-critical edge and satisfying χ ≥ ∆ ≥ 6, then G contains a K∆.
EJC
2007
13 years 6 months ago
2007
Let K− r denote the graph obtained from Kr by deleting one edge. We show that for every integer r ≥ 4 there exists an integer n0 = n0(r) such that every graph G whose order n â...