On Contracting Graphs to Fixed Pattern Graphs

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

Daniël Paulusma, Marcin Kaminski, Stefan Szeider, 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

68R10: Graph theory (including graph drawing) in computer science

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