✦ LIBER ✦

Efficient Vertex- and Edge-Coloring of Outerplanar Graphs

✍ Scribed by Proskurowski, Andrzej; Sysło, Maciej M.

Book ID: 118213025
Publisher: Society for Industrial and Applied Mathematics
Year: 1986
Weight: 780 KB
Volume: 7
Category: Article
ISSN: 0196-5212
DOI: 10.1137/0607016

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Acyclic list edge coloring of outerplana

Acyclic list edge coloring of outerplanar graphs

✍ Qiaojun Shu; Yiqiao Wang; Weifan Wang 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 282 KB

Adjacent vertex distinguishing total col

Adjacent vertex distinguishing total colorings of outerplanar graphs

✍ Yiqiao Wang; Weifan Wang 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 324 KB

On vertex-coloring edge-weighting of gra

On vertex-coloring edge-weighting of graphs

✍ Hongliang Lu; Xu Yang; Qinglin Yu 📂 Article 📅 2009 🏛 Higher Education Press and Springer 🌐 English ⚖ 159 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

Applications of edge coloring of multigr

Applications of edge coloring of multigraphs to vertex coloring of graphs

✍ H.A. Kierstead 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 754 KB

Some undecidable problems involving the

Some undecidable problems involving the edge-coloring and vertex-coloring of graphs

✍ Stefan A. Burr 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 477 KB

Certain problems involving the coloring the edges or vertices of infinite graphs are shown to be undecidable. In particular, let G and H be finite 3-connected graphs, or triangles. Then a doubly-periodic infinite graph F is constructed such that the following problem is undecidable: For a coloring o