✦ LIBER ✦

Coloring the square of the Kneser graph and the Schrijver graph

✍ Scribed by Jun-Yo Chen; Ko-Wei Lih; Jiaojiao Wu

Book ID: 108112765
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 826 KB
Volume: 157
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2008.05.010

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The energy of -Kneser graphs and attenua

The energy of -Kneser graphs and attenuated -Kneser graphs

✍ Lv, Benjian; Wang, Kaishun 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 361 KB

Coloring the square of a planar graph

✍ Jan van den Heuvel; Sean McGuinness 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB 👁 2 views

## Abstract We prove that for any planar graph __G__ with maximum degree Δ, it holds that the chromatic number of the square of __G__ satisfies χ(__G__^2^) ≤ 2Δ + 25. We generalize this result to integer labelings of planar graphs involving constraints on distances one and two in the graph. © 2002

List-coloring the square of a subcubic g

List-coloring the square of a subcubic graph

✍ Daniel W. Cranston; Seog-Jin Kim 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 266 KB 👁 1 views

## Abstract The __square__ __G__^2^ of a graph __G__ is the graph with the same vertex set __G__ and with two vertices adjacent if their distance in __G__ is at most 2. Thomassen showed that every planar graph __G__ with maximum degree Δ(__G__) = 3 satisfies χ(__G__^2^) ≤ 7. Kostochka and Woodall c

The eigenvalues of -Kneser graphs

✍ Benjian Lv; Kaishun Wang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 178 KB

Improved bounds on the chromatic numbers

Improved bounds on the chromatic numbers of the square of Kneser graphs

✍ Kim, Seog-Jin; Park, Boram 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 405 KB

Symmetries of the stable Kneser graphs

✍ Benjamin Braun 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 130 KB