𝔖 Bobbio Scriptorium
✦   LIBER   ✦

NP-completeness and APX-completeness of restrained domination in graphs

✍ Scribed by Lei Chen; Weiming Zeng; Changhong Lu

Book ID
116907369
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
299 KB
Volume
448
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

NP-completeness of list coloring and pre
NP-completeness of list coloring and precoloring extension on the edges of planar graphs
✍ DΓ‘niel Marx πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 110 KB

## Abstract In the edge precoloring extension problem, we are given a graph with some of the edges having preassigned colors and it has to be decided whether this coloring can be extended to a proper __k__‐edge‐coloring of the graph. In list edge coloring every edge has a list of admissible colors,