English

Obtaining Planarity by Contracting Few Edges

Data Structures and Algorithms 2012-04-24 v1 Discrete Mathematics Combinatorics
Authors: Petr A. Golovach , Pim van 't Hof , Daniel Paulusma
View on arXiv ↗ PDF ↗

Abstract

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.

Keywords

planar graph drawing parameterized complexity graph theory

Cite

@article{arxiv.1204.5113,
  title  = {Obtaining Planarity by Contracting Few Edges},
  author = {Petr A. Golovach and Pim van 't Hof and Daniel Paulusma},
  journal= {arXiv preprint arXiv:1204.5113},
  year   = {2012}
}

Comments

16 pages, 5 figures

Related papers

View all related →
Data Structures and Algorithms · Computer Science
MSOL Restricted Contractibility to Planar Graphs
James Abello, Pavel Klavík, Jan Kratochvíl, Tomáš Vyskočil
2017-05-08
Data Structures and Algorithms · Computer Science
The $st$-Planar Edge Completion Problem is Fixed-Parameter Tractable
Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani +1
2023-09-28
Computational Geometry · Computer Science
On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani +1
2023-09-07
Data Structures and Algorithms · Computer Science
Parameterized Complexity of 1-Planarity
Michael J. Bannister, Sergio Cabello, David Eppstein
2018-12-18
Data Structures and Algorithms · Computer Science
Structural Parameterizations of $k$-Planarity
Tatsuya Gima, Yasuaki Kobayashi, Yuto Okada
2025-08-28
Computational Geometry · Computer Science
Adding one edge to planar graphs makes crossing number and 1-planarity hard
Sergio Cabello, Bojan Mohar
2012-03-28
Data Structures and Algorithms · Computer Science
Tractability of Konig Edge Deletion Problems
Diptapriyo Majumdar, Rian Neogi, Venkatesh Raman, S. Vaishali
2019-09-26
Computational Geometry · Computer Science
Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable
Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani +1
2023-02-21
Discrete Mathematics · Computer Science
On retracts, absolute retracts, and folds in cographs
Ton Kloks, Yue-Li Wang
2013-03-26
Data Structures and Algorithms · Computer Science
Contracting edges to destroy a pattern: A complexity study
Dipayan Chakraborty, R. B. Sandeep
2023-07-26
Discrete Mathematics · Computer Science
The complexity of blocking (semi)total dominating sets with edge contractions
Esther Galby
2022-05-26
Data Structures and Algorithms · Computer Science
Obtaining a Planar Graph by Vertex Deletion
Dániel Marx, Ildikó Schlotter
2008-12-31
Computational Complexity · Computer Science
Pathways to Tractability for Geometric Thickness
Thomas Depian, Simon Dominik Fink, Alexander Firbas, Robert Ganian +1
2024-11-26
Combinatorics · Mathematics
Some NP-complete edge packing and partitioning problems in planar graphs
Jed Yang
2014-09-09
Computational Geometry · Computer Science
Min-1-Planarity is NP-Hard
Yuto Okada
2026-05-25
Data Structures and Algorithms · Computer Science
Planar Disjoint-Paths Completion
Isolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos
2015-11-18
Combinatorics · Mathematics
Testing Gap k-planarity is NP-complete
John C. Urschel, Jake Wellens
2020-05-19
Data Structures and Algorithms · Computer Science
Parameterized Algorithms for Finding Square Roots
Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch +1
2013-10-22
Discrete Mathematics · Computer Science
Minimum k-way cut of bounded size is fixed-parameter tractable
Ken-ichi Kawarabayashi, Mikkel Thorup
2011-01-27
Data Structures and Algorithms · Computer Science
Rectilinear Planarity of Partial 2-Trees
Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali
2023-06-23
Data Structures and Algorithms · Computer Science
Contracting Graphs to Paths and Trees
Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov +1
2011-04-20
Computational Complexity · Computer Science
On the Parameterized Complexity of the Acyclic Matching Problem
Sahab Hajebi, Ramin Javadi
2022-10-05
Computational Geometry · Computer Science
Drawing Partially Embedded and Simultaneously Planar Graphs
Timothy M. Chan, Fabrizio Frati, Carsten Gutwenger, Anna Lubiw +2
2014-10-31
Geometric Topology · Mathematics
On a Planarity Criterion Coming from Knot Theory
J. Sawollek
2007-05-23
Computational Geometry · Computer Science
Crossing-Optimal Extension of Simple Drawings
Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada +1
2020-12-15
R2 v1 2026-06-21T20:53:34.084Z