A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
A note on contracting claw-free graphs
2013
Discrete Mathematics & Theoretical Computer Science
Discrete Algorithms International audience A graph containment problem is to decide whether one graph called the host graph can be modified into some other graph called the target graph by using a number of specified graph operations. We consider edge deletions, edge contractions, vertex deletions and vertex dissolutions as possible graph operations permitted. By allowing any combination of these four operations we capture the following problems: testing on (induced) minors, (induced)
doi:10.46298/dmtcs.605
fatcat:hrmcp2vu7jehnm432miqaeucam