A note on contracting claw-free graphs

Abstrakt

We show several results on computational complexity of finding a contraction of a graph to a path.

Klíčová slova

• computational complexity
• contraction
• claw-free graph