𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the path-avoidance vertex-coloring game

✍ Scribed by Torsten Mütze; Reto Spöhel

Book ID
119236628
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
189 KB
Volume
38
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The permutation-path coloring problem on
The permutation-path coloring problem on trees
✍ Sylvie Corteel; Mario Valencia-Pabon; Danièle Gardy; Dominique Barth; Alain Deni 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 292 KB

In this paper we ÿrst show that the permutation-path coloring problem is NP-hard even for very restrictive instances like involutions, which are permutations that contain only cycles of length at most two, on both binary trees and on trees having only two vertices with degree greater than two, and f