✦ LIBER ✦

On the Chromatic Number ofH-Free Graphs of Large Minimum Degree

✍ Scribed by Jeremy Lyle

Book ID: 106047929
Publisher: Springer Japan
Year: 2010
Tongue: English
Weight: 304 KB
Volume: 27
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-010-0994-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Chromatic Number of Triangle-Free

On the Chromatic Number of Triangle-Free Graphs of Large Minimum Degree

✍ Carsten Thomassen 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 117 KB

On The Chromatic Number Of Pentagon-Free

On The Chromatic Number Of Pentagon-Free Graphs Of Large Minimum Degree

✍ Carsten Thomassen 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 88 KB

The total chromatic number of graphs hav

The total chromatic number of graphs having large maximum degree

✍ A.J.W. Hilton; H.R. Hind 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 935 KB

Hilton, A.J.W. and H.R. Hind, The total chromatic number ofgraphs having large maximum degree, Discrete Mathematics 117 (1993) 127-140. The total colouring conjecture is shown to be correct for those graphs G having d(G)>21 V(G)I.

On The Structure Of Triangle-Free Graphs

On The Structure Of Triangle-Free Graphs Of Large Minimum Degree

✍ Tomasz Łuczak* 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 125 KB

On graphs with small subgraphs of large

On graphs with small subgraphs of large chromatic number

✍ V. Rödl; R. A. Duke 📂 Article 📅 1985 🏛 Springer Japan 🌐 English ⚖ 296 KB

The chromatic index of graphs with large

The chromatic index of graphs with large maximum degree

✍ Michael J. Plantholt 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 508 KB

Vizing's Theorem, any graph G has chromatic index equal either to its maximum degree A(G) or A(G) + 1. A simple method is given for determining exactly the chromatic index of any graph with 2s + 2 vertices and maximum degree 2s.