Some recent results on list coloring

Some results on list T-colourings

✍ Adrian O. Waller 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 271 KB

In this paper we will give some results on list T-colorings. In particular we will give a lower bound for the T-choice number of even cycles with the set T = {0, 1,2 ..... r}, r ~> 1, and give the value of the T-choice number for the even cycles C4, and C2n where n>~r.

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

Some recent results on meson spectroscop

Some recent results on meson spectroscopy

✍ S.U. Chung 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 492 KB

Some recent results on niche graphs

✍ Stephen Bowser; Charles A. Cable 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 435 KB

On list coloring Steiner triple systems

✍ P. E. Haxell; M. Pei 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 105 KB

## Abstract We study the list chromatic number of Steiner triple systems. We show that for every integer __s__ there exists __n__~0~=__n__~0~(__s__) such that every Steiner triple system on __n__ points STS(__n__) with __n__≥__n__~0~ has list chromatic number greater than __s__. We also show that t

On a list coloring conjecture of Reed

✍ Tom Bohman; Ron Holzman 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 54 KB

## Abstract We construct graphs with lists of available colors for each vertex, such that the size of every list exceeds the maximum vertex‐color degree, but there exists no proper coloring from the lists. This disproves a conjecture of Reed. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 106–10