𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On backbone coloring of graphs

✍ Scribed by Weifan Wang; Yuehua Bu; Mickaël Montassier; André Raspaud

Publisher
Springer US
Year
2010
Tongue
English
Weight
507 KB
Volume
23
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Backbone colorings for graphs: Tree and
Backbone colorings for graphs: Tree and path backbones
✍ Hajo Broersma; Fedor V. Fomin; Petr A. Golovach; Gerhard J. Woeginger 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 158 KB

## Abstract We introduce and study backbone colorings, a variation on classical vertex colorings: Given a graph __G__ = (__V__,__E__) and a spanning subgraph __H__ of __G__ (the backbone of __G__), a backbone coloring for __G__ and __H__ is a proper vertex coloring __V__ → {1,2,…} of __G__ in which

On thefg-coloring of graphs
On thefg-coloring of graphs
✍ S. Nakano; T. Nishizeki; N. Saito 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 739 KB
Random coloring evolution on graphs
Random coloring evolution on graphs
✍ Xin Xing Chen; Jian Gang Ying 📂 Article 📅 2010 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 178 KB
On list-coloring outerplanar graphs
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

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