Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths

DOI10.1007/978-3-642-25591-5_13zbMath1350.68129OpenAlexW1507920302MaRDI QIDQ3104605

Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Rémy Belmonte, Petr A. Golovach, Daniël Paulusma

Publication date: 16 December 2011

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25591-5_13

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Graph minors (05C83) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (7)

Increasing the Minimum Degree of a Graph by Contractions ⋮ Detecting induced star-like minors in polynomial time ⋮ Increasing the minimum degree of a graph by contractions ⋮ Large Induced Subgraphs via Triangulations and CMSO ⋮ Edge contractions in subclasses of chordal graphs ⋮ Detecting fixed patterns in chordal graphs in polynomial time ⋮ Containment relations in split graphs

This page was built for publication: Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths