𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Systematic generation of linear graphs— Check and extension of the list of uhlenbeck and ford

✍ Scribed by Ch Foidl; P Kasperkovitz

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
55 KB
Volume
85
Category
Article
ISSN
0021-9991

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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,