✦ LIBER ✦

Circular list colorings of some graphs

✍ Scribed by Guanghui Wang; Guizhen Liu; Jiguo Yu

Publisher: Springer-Verlag
Year: 2006
Tongue: English
Weight: 193 KB
Volume: 20
Category: Article
ISSN: 1598-5865
DOI: 10.1007/bf02831929

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Oriented list colorings of graphs

✍ Zs. Tuza; M. Voigt 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 159 KB 👁 1 views

A 2-assignment on a graph G (V,E) is a collection of pairs Lv of allowed colors speci®ed for all vertices v PV. The graph G (with at least one edge) is said to have oriented choice number 2 if it admits an orientation which satis®es the following property: For every 2-assignment there exists a choic

List T-colorings of graphs

✍ Barry A. Tesman 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 876 KB

Circular colorings of weighted graphs

✍ Deuber, Walter A.; Zhu, Xuding 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 776 KB

Suppose that G is a finite simple graph and w is a weight function which assigns to each vertex of G a nonnegative real number. Let C be a circle of length t . A t-circular coloring of (G,w) is a mapping A of the vertices of G to arcs of C such that A(%) n A(y) = 0 if (x, y) E E ( G ) and A(x) has l

Circular colorings of edge-weighted grap

Circular colorings of edge-weighted graphs

✍ Bojan Mohar 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 99 KB

## Abstract The notion of (circular) colorings of edge‐weighted graphs is introduced. This notion generalizes the notion of (circular) colorings of graphs, the channel assignment problem, and several other optimization problems. For instance, its restriction to colorings of weighted complete graphs

Sum List Coloring Graphs

✍ Adam Berliner; Ulrike Bostelmann; Richard A. Brualdi; Louis Deaett 📂 Article 📅 2006 🏛 Springer Japan 🌐 English ⚖ 137 KB

List Colorings of K5-Minor-Free Graphs W

List Colorings of K5-Minor-Free Graphs With Special List Assignments

✍ Daniel W. Cranston; Anja Pruchnewski; Zsolt Tuza; Margit Voigt 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 201 KB

The following question was raised by Bruce Richter. Let G be a planar, 3-connected graph that is not a complete graph. Denoting by d(v) the degree of vertex v, is G L-list colorable for every list assignment L with |L(v)|=min{d(v), 6} for all v ∈ V (G)? More generally, we ask for which pairs (r, k)