Obtaining planarity by contracting few edges

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

doi:10.1016/j.tcs.2012.12.041

Obtaining planarity by contracting few edges

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

Authors

P.A. Golovach

P. van 't Hof

Professor Daniel Paulusma daniel.paulusma@durham.ac.uk
Professor

Abstract

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.

Citation

Golovach, P., van 't Hof, P., & Paulusma, D. (2013). Obtaining planarity by contracting few edges. Theoretical Computer Science, 476, 38-46. https://doi.org/10.1016/j.tcs.2012.12.041

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
DOI	https://doi.org/10.1016/j.tcs.2012.12.041
Public URL	https://durham-repository.worktribe.com/output/1465406

Files

Accepted Journal Article (501 Kb)
PDF

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