✦ LIBER ✦

Note on coloring graphs without odd--minors

✍ Scribed by Ken-ichi Kawarabayashi

Book ID: 108167467
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 115 KB
Volume: 99
Category: Article
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2008.12.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Vertex colorings of graphs without short

Vertex colorings of graphs without short odd cycles

✍ Andrzej Dudek; Reshma Ramadurai 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB 👁 1 views

Motivated by the work of Nešetřil and R ödl on "Partitions of vertices" we are interested in obtaining some quantitative extensions of their result. In particular, given a natural number r and a graph G of order m with odd girth g, we show the existence of a graph H with odd girth at least g and ord

A note on the total coloring of planar g

A note on the total coloring of planar graphs without adjacent 4-cycles

✍ Hui-Juan Wang; Jian-Liang Wu 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 233 KB

A note on relaxed equitable coloring of

A note on relaxed equitable coloring of graphs

✍ Hao Fan; H.A. Kierstead; Guizhen Liu; Theodore Molla; Jian-Liang Wu; Xin Zhang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 401 KB

A note on list improper coloring planar

A note on list improper coloring planar graphs

✍ Ko-Wei Lih; Zengmin Song; Weifan Wang; Kemin Zhang 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 267 KB

A graph G is called (k, d)\*-choosable if, for every list assignment L satisfying [L(v)l = k for all v E V(G), there is an L-coloring of G such that each vertex of G has at most d neighbors colored with the same color as itself. In this note, we prove that every planar graph without 4-cycles and /-c

A Note on First-Fit Coloring of Interval

A Note on First-Fit Coloring of Interval Graphs

✍ N. S. Narayanaswamy; R. Subhash Babu 📂 Article 📅 2008 🏛 Springer Netherlands 🌐 English ⚖ 223 KB

Colorings of infinite graphs without one

Colorings of infinite graphs without one-colored rays

✍ Norbert Polat 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 773 KB

The R-chromatic number of a graph G is the least number of subsets of vertices forming a partition of V ( G ) , and which induce subgraphs of G without infinite paths. For any integer n 2 2, we give sufficient conditions for a graph containing no subdivision of an infinite complete graph to have a R