✦ LIBER ✦

A Note on Semi-coloring of Graphs

✍ Scribed by Baoyindureng Wu, Xingchao Deng, Xinhui An, Guiying Yan

Book ID: 120788714
Publisher: Springer Japan
Year: 2012
Tongue: English
Weight: 155 KB
Volume: 29
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-012-1171-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Note on coloring graphs without odd--min

Note on coloring graphs without odd--minors

✍ Ken-ichi Kawarabayashi 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 115 KB

A Note on Graph Colorings and Graph Poly

A Note on Graph Colorings and Graph Polynomials

✍ Noga Alon; Michael Tarsi 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 230 KB

## dedicated to professor w. t. tutte on the occasion of his eightieth birtday It is known that the chromatic number of a graph G=(V, E) with V= [1, 2, ..., n] exceeds k iff the graph polynomial f G => ij # E, i<j (x i &x j ) lies in certain ideals. We describe a short proof of this result, using

A note on local colorings of graphs

✍ Andrzej Ruciński; Miroslaw Truszczyński 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 223 KB

Recently, R6dl and Rucifiski [5,6] proved the following threshold result about Ramsey properties of random graphs. Let K(n, p) be the binomial random graph obtained from the complete graph K(n) by independent deletion of each edge with probability 1 -p. We write F ~ (G)r if for every r-coloring of t