On 29.10.2009 at 12:20 in corridor, there is the following noon lecture:
Finding induced paths in claw-free graphs
joint work with M. Kaminski, B. Lidicky, and D. Paulusma
We show that for a fixed number of terminals, it is possible to find in a polynomial time an induced path in a claw-free graph that passes through the given set of terminals. The core part of the proof is based on a structural characterization of quasi-line graphs by Chudnovsky and Seymour.
Webmaster: kamweb.mff.cuni.cz Modified: 19. 10. 2010