✦ LIBER ✦

On thefg-coloring of graphs

✍ Scribed by S. Nakano; T. Nishizeki; N. Saito

Publisher: Springer-Verlag
Year: 1990
Tongue: English
Weight: 739 KB
Volume: 10
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf02122697

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On backbone coloring of graphs

✍ Weifan Wang; Yuehua Bu; Mickaël Montassier; André Raspaud 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 507 KB

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

Coloring inductive graphs on-line

✍ Sandy Irani 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 895 KB

On Coloring Unit Disk Graphs

✍ A. Gräf; M. Stumpf; G. Weißenfels 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 237 KB

Random coloring evolution on graphs

✍ Xin Xing Chen; Jian Gang Ying 📂 Article 📅 2010 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 178 KB

On equitable coloring of bipartite graph

On equitable coloring of bipartite graphs

✍ Ko-Wei Lih; Pou-Lin Wu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 285 KB

If the vertices of a graph G are partitioned into k classes V~, I/2 ..... Vk such that each V~ is an independent set and I1V~I-IV~[I ~< 1 for all i#j, then G is said to be equitably colored with k colors. The smallest integer n for which G can be equitably colored with n colors is called the equitab