𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Precoloring Extension for 2‐connected Graphs

✍ Scribed by Voigt, Margit

Book ID
118197592
Publisher
Society for Industrial and Applied Mathematics
Year
2007
Tongue
English
Weight
133 KB
Volume
21
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Precoloring extension for K4-minor-free
Precoloring extension for K4-minor-free graphs
✍ Anja Pruchnewski; Margit Voigt 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 230 KB 👁 1 views

## Abstract Let __G__=(__V, E__) be a graph where every vertex __v__∈__V__ is assigned a list of available colors __L__(__v__). We say that __G__ is list colorable for a given list assignment if we can color every vertex using its list such that adjacent vertices get different colors. If __L__(__v_

NP completeness of the edge precoloring
NP completeness of the edge precoloring extension problem on bipartite graphs
✍ Jiří Fiala 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 63 KB 👁 1 views

## Abstract We show that the following problem is __NP__ complete: Let __G__ be a cubic bipartite graph and __f__ be a precoloring of a subset of edges of __G__ using at most three colors. Can __f__ be extended to a proper edge 3‐coloring of the entire graph __G__? This result provides a natural co