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 Hog, P. and Paulusma, Daniel (2012) 'Obtaining planarity by contracting few edges.', in Mathematical foundations of computer science 2012 : 37th international symposium, MFCS 2012, Bratislava, Slovakia, 27-31 August 2012 ; proceedings. Berlin ; Heidelberg: Springer, pp. 455-466. Lecture notes in computer science. (7464).


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

Item Type:Book chapter
Keywords:Planar graphs, Edge contractions, FPT algorithms.
Full text:Full text not available from this repository.
Publisher Web site:
Date accepted:No date available
Date deposited:No date available
Date of first online publication:2012
Date first made open access:No date available

Save or Share this output

Look up in GoogleScholar