𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Coloring chip configurations on graphs and digraphs

✍ Scribed by Mieczysław Borowiecki; Jarosław Grytczuk; Monika Pilśniak


Book ID
113663255
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
131 KB
Volume
112
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


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 Edge Coloring Bipartite Graphs
✍ Cole, Richard; Hopcroft, John 📂 Article 📅 1982 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 825 KB
Random coloring evolution on graphs
✍ Xin Xing Chen; Jian Gang Ying 📂 Article 📅 2010 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 178 KB