Contractions of Planar Graphs in Polynomial Time


We prove that for every graph H, there exists a polynomial-time algorithm deciding if a planar graph can be contracted to H. We introduce contractions and topological minors of embedded (plane) graphs and show that a plane graph H is an embedded contraction of a plane graph G, if and only if, the dual of H is an embedded topological minor of the dual of G… (More)
DOI: 10.1007/978-3-642-15775-2_11


Cite this paper

@inproceedings{Kaminski2010ContractionsOP, title={Contractions of Planar Graphs in Polynomial Time}, author={Marcin Kaminski and Dani{\"e}l Paulusma and Dimitrios M. Thilikos}, booktitle={ESA}, year={2010} }