Skip to main content

Research Repository

Advanced Search

Obtaining planarity by contracting few edges

Golovach, P.A.; van 't Hof, P.; Paulusma, D.

Obtaining planarity by contracting few edges Thumbnail


P.A. Golovach

P. van 't Hof


The Planar Contraction problem is to test whether a given graph can be made planar by using at most kk edge contractions. This problem is known to be NP-complete. We show that it is fixed-parameter tractable when parameterized by kk.


Golovach, P., van 't Hof, P., & Paulusma, D. (2013). Obtaining planarity by contracting few edges. Theoretical Computer Science, 476, 38-46.

Journal Article Type Article
Publication Date Mar 1, 2013
Deposit Date Mar 11, 2013
Publicly Available Date Apr 17, 2013
Journal Theoretical Computer Science
Print ISSN 0304-3975
Publisher Elsevier
Peer Reviewed Peer Reviewed
Volume 476
Pages 38-46


Accepted Journal Article (501 Kb)

Copyright Statement
NOTICE: this is the author’s version of a work that was accepted for publication in Theoretical computer science. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Theoretical computer science, 476, 2013, 10.1016/j.tcs.2012.12.041

You might also like

Downloadable Citations