✦ LIBER ✦

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

✍ Scribed by Carsten Thomassen

Book ID: 106167630
Publisher: Springer-Verlag
Year: 2007
Tongue: English
Weight: 88 KB
Volume: 27
Category: Article
ISSN: 0209-9683
DOI: 10.1007/s00493-007-0054-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Chromatic Number ofH-Free Graphs

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

✍ Jeremy Lyle 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 304 KB

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

Configurations in Graphs of Large Minimu

Configurations in Graphs of Large Minimum Degree, Connectivity, or Chromatic Number

✍ CARSTEN THOMASSEN 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 570 KB

The Total Chromatic Number of Graphs of

The Total Chromatic Number of Graphs of High Minimum Degree

✍ Chetwynd, A. G.; Hilton, A. J. W.; Cheng, Z. 📂 Article 📅 1991 🏛 Oxford University Press 🌐 English ⚖ 229 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