𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Counterexamples to the List Square Coloring Conjecture

✍ Scribed by Kim, Seog-Jin; Park, Boram


Book ID
121731842
Publisher
John Wiley and Sons
Year
2014
Tongue
English
Weight
284 KB
Volume
78
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A counterexample to the rank-coloring co
✍ N. Alon; P. D. Seymour πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 140 KB

It has been conjectured by C. van Nuffelen that the chromatic number of any graph with at least one edge does not exceed the rank of its adjacency matrix. We give a counterexample, with chromatic number 32 and with an adjacency matrix of rank 29.

List-coloring the square of a subcubic g
✍ 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