Contracting chordal graphs and bipartite graphs to paths and trees

DOI10.1016/j.dam.2013.02.025zbMath1288.05060MaRDI QIDQ5920327

Christophe Paul, Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque

Publication date: 5 May 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.02.025

zbMATH Keywords

chordal graphs; polynomial time algorithms; graph modification problems; edge contractions

Mathematics Subject Classification ID

05C10: Planar graphs; geometric and topological aspects of graph theory

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)