✦ LIBER ✦

Totally Odd-subdivisions in 4-chromatic Graphs

✍ Scribed by Carsten Thomassen

Publisher: Springer-Verlag
Year: 2001
Tongue: English
Weight: 363 KB
Volume: 21
Category: Article
ISSN: 0209-9683
DOI: 10.1007/s004930100006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Special subdivisions ofK4and 4-chromatic

Special subdivisions ofK4and 4-chromatic graphs

✍ Uffe Krusenstjerna-Hafstrøm; Bjarne Toft 📂 Article 📅 1980 🏛 Springer Vienna 🌐 English ⚖ 526 KB

Short odd cycles in 4-chromatic graphs

✍ Nilli, A. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 163 KB 👁 3 views

It is shown that any 4-chromatic graph on n vertices contains an odd cycle of length smaller than √ 8n.

Small odd cycles in 4-chromatic graphs

✍ Tao Jiang 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 50 KB

## Abstract It is shown that every 4‐chromatic graph on __n__ vertices contains an odd cycle of length less than $2\sqrt {n}\,+3$. This improves the previous bound given by Nilli [J Graph Theory 3 (1999), 145–147]. © 2001 John Wiley & Sons, Inc. J Graph Theory 37: 115–117, 2001

4-chromatic graphs with large odd girth

✍ Nguyen Van Ngoc; Zsolt Tuza 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 251 KB

It is known that the Mycielski graph can be generalized to obtain an infinite family of 4-chromatic graphs with no short odd cycles. The first proof of this result, due to Stiebitz, applied the topological method of Lov~sz. The proof presented here is elementary combinatorial.

On odd circuits in chromatic graphs

✍ W. G. Brown; H. A. Jung 📂 Article 📅 1969 🏛 Akadmiai Kiad 🌐 English ⚖ 367 KB

Total chromatic number of regular graphs

Total chromatic number of regular graphs of odd order and high degree

✍ K.H. Chew 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 695 KB

The total chromatic number XT(G) of a graph G is the least number of colours needed to colour the edges and vertices of G so that no incident or adjacent elements receive the same colour. This paper shows that if G is odd order and regular of degree d > [(&? -1)/6]1 V(G)/, then a necessary and suffi