scientific article; zbMATH DE number 7651190
From MaRDI portal
Publication:5874521
DOI10.4230/LIPIcs.ESA.2020.51MaRDI QIDQ5874521
Petr A. Golovach, Dimitrios M. Thilikos, Fedor V. Fomin, Giannos Stamoulis
Publication date: 7 February 2023
Full work available at URL: https://arxiv.org/abs/2106.03425
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
planar graphsalgorithmic meta-theoremsgraph modification problemsfirst order logicirrelevant vertex techniquesurface embeddable graphs
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph minors. XX: Wagner's conjecture
- Vertex-minors, monadic second-order logic, and a conjecture by Seese
- The node-deletion problem for hereditary properties is NP-complete
- Graph minors. XIII: The disjoint paths problem
- Obtaining planarity by contracting few edges
- Contraction obstructions for treewidth
- Deleting vertices to graphs of bounded genus
- Obtaining a planar graph by vertex deletion
- Parametrized complexity theory.
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Fixed-Parameter Tractability, Definability, and Model-Checking
- Tight Bounds for Linkages in Planar Graphs
- Deciding first-order properties of locally tree-decomposable structures
- Graph minors. II. Algorithmic aspects of tree-width
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
- Deciding First-Order Properties of Nowhere Dense Graphs
- Modification to Planarity is Fixed Parameter Tractable
- Planarity Allowing Few Error Vertices in Linear Time
- Bidimensional Parameters and Local Treewidth
- A Near-Optimal Planarization Algorithm
- Testing first-order properties for subclasses of sparse graphs
- An algorithm for the graph crossing number problem
- Finding topological subgraphs is fixed-parameter tractable
- The Parameterized Complexity of Graph Cyclability
This page was built for publication:
