✦ LIBER ✦

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

✍ Scribed by CARSTEN THOMASSEN

Book ID: 119863038
Publisher: John Wiley and Sons
Year: 1989
Tongue: English
Weight: 570 KB
Volume: 555
Category: Article
ISSN: 0890-6564
DOI: 10.1111/j.1749-6632.1989.tb22479.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Subgraphs of large connectivity and chro

Subgraphs of large connectivity and chromatic number in graphs of large chromatic number

✍ N. Alon; D. Kleitman; C. Thomassen; M. Saks; P. Seymour 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB

For each pair k, rn of natural numbers there exists a natural number f(k, rn) such that every f ( k , m)-chromatic graph contains a k-connected subgraph of chromatic number at least rn.

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

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 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

Partitions of graphs with high minimum d

Partitions of graphs with high minimum degree or connectivity

✍ Daniela Kühn; Deryk Osthus 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 203 KB