• Citer

Contraction checking in graphs on surfaces

par Kaminski, Marcin ;Thilikos Touloupas, Dimitrios
Référence Leibniz international proceedings in informatics, 14, page (182-193)
Publication Publié, 2012

Article révisé par les pairs

• Détails
• Contenu

Résumé :

The CONTRACTION CHECKING problem asks, given two graphs H and G as input, whether H can be obtained from G by a sequence of edge contractions. CONTRACTION CHECKING remains NP-complete, even when H is fixed. We show that this is not the case when G is embeddable in a surface of fixed Euler genus. In particular, we give an algorithm that solves CONTRACTION CHECKING in f(h,g) ·