✦ LIBER ✦

An asymptotically tight bound on the adaptable chromatic number

✍ Scribed by Michael Molloy; Giovanna Thron

Book ID: 112121096
Publisher: John Wiley and Sons
Year: 2012
Tongue: English
Weight: 204 KB
Volume: 71
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.20649

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An asymptotically tight bound on the num

An asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions

✍ Saugata Basu; Richard Pollack; Marie-Françoise Roy 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 536 KB

A Bound on the Total Chromatic Number

✍ Michael Molloy; Bruce Reed 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 481 KB

An upper bound for the total chromatic n

An upper bound for the total chromatic number

✍ H. R. Hind 📂 Article 📅 1990 🏛 Springer Japan 🌐 English ⚖ 379 KB

An improved bound for the strong chromat

An improved bound for the strong chromatic number

✍ P. E. Haxell 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 156 KB 👁 1 views

## Abstract Let η > 0 be given. Then there exists __d__~0~ = __d__~0~(η) such that the following holds. Let __G__ be a finite graph with maximum degree at most __d__ ≥ __d__~0~ whose vertex set is partitioned into classes of size α __d__, where α≥ 11/4 + η. Then there exists a proper coloring of __

A Bound on the Chromatic Number of an Al

A Bound on the Chromatic Number of an Almost Planar Graph

✍ Nenashev, G. V. 📂 Article 📅 2014 🏛 Springer US 🌐 English ⚖ 296 KB

A New Bound on the Cyclic Chromatic Numb

A New Bound on the Cyclic Chromatic Number

✍ Daniel P. Sanders; Yue Zhao 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 116 KB

In 1969, Ore and Plummer defined an angular coloring as a natural extension of the Four Color Problem: a face coloring of a plane graph where faces meeting even at a vertex must have distinct colors. A natural lower bound is the maximum degree 2 of the graph. Some graphs require w 3 2 2x colors in a