On Contracting Graphs to Fixed Pattern Graphs

DOI10.1007/978-3-642-11266-9_42zbMath1274.68277OpenAlexW2112018378MaRDI QIDQ3401113

Stefan Szeider, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos, Pim van 't Hof

Publication date: 28 January 2010

Published in: SOFSEM 2010: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11266-9_42

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Edge contractions in subclasses of chordal graphs ⋮ Edge Contractions in Subclasses of Chordal Graphs ⋮ Contracting chordal graphs and bipartite graphs to paths and trees

This page was built for publication: On Contracting Graphs to Fixed Pattern Graphs