We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

Obtaining planarity by contracting few edges.

Golovach, P.A. and van 't Hof, P. and Paulusma, Daniel (2013) 'Obtaining planarity by contracting few edges.', Theoretical computer science., 476 . pp. 38-46.


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.

Item Type:Article
Full text:(AM) Accepted Manuscript
Download PDF
Publisher Web site:
Publisher 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
Date accepted:No date available
Date deposited:17 April 2013
Date of first online publication:March 2013
Date first made open access:No date available

Save or Share this output

Look up in GoogleScholar