✦ LIBER ✦

List T-colorings of graphs

✍ Scribed by Barry A. Tesman

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 876 KB
Volume: 45
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(93)90015-g

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

T-colorings of graphs

✍ Daphne Der-Fen Liu 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 594 KB

Given a finite set T of positive integers containing {0}, a T-coloring of a simple graph G is a nonnegative integer function f defined on the vertex set of G, such that if (u, v} E E(G) then Lf(u) -f (u)l $ T. The T-span of a T-coloring is defined as the difference of the largest and smallest colors

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)

On list-coloring outerplanar graphs

✍ Joan P. Hutchinson 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 162 KB

## Abstract We prove that a 2‐connected, outerplanar bipartite graph (respectively, outerplanar near‐triangulation) with a list of colors __L__ (__v__ ) for each vertex __v__ such that $|L(v)|\geq\min\{{\deg}(v),4\}$ (resp., $|L(v)|\geq{\min}\{{\deg}(v),5\}$) can be __L__‐list‐colored (except when

Adapted list coloring of planar graphs

✍ Louis Esperet; Mickaël Montassier; Xuding Zhu 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 131 KB 👁 1 views

## Abstract Given an edge coloring __F__ of a graph __G__, a vertex coloring of __G__ is __adapted to F__ if no color appears at the same time on an edge and on its two endpoints. If for some integer __k__, a graph __G__ is such that given any list assignment __L__ to the vertices of __G__, with |_

A rainbow about T-colorings for complete

A rainbow about T-colorings for complete graphs

✍ Klaus Jansen 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 700 KB

Given a finite set T of positive integers, with 0 E T, a T-coloring of a graph G = (V, E) is a functionf: V -+ No such that for each {x, y} E E If(x) -f(y)l#T. The T-span is the difference between the largest and smallest colors and the T-span of G is the minimum span over all T-colorings of G. We s