Splitting plane graphs to outerplanarity
DOI10.7155/JGAA.V28I3.2970MaRDI QIDQ6636997
Anaïs Villedieu, Martin Nöllenburg, Martin Gronemann
Publication date: 12 November 2024
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A \(13k\)-kernel for planar feedback vertex set via region decomposition
- On triangulating \(k\)-outerplanar graphs
- Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs
- Minimum size of feedback vertex sets of planar graphs of girth at least five
- The splitting number of complete bipartite graphs
- Three ways to cover a graph
- The toroidal splitting number of the complete graph \(K_ n\)
- The splitting number of the complete graph in the projective plane
- On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three
- The book thickness of a graph
- The node-deletion problem for hereditary properties is NP-complete
- A partial k-arboretum of graphs with bounded treewidth
- On the edge-length ratio of outerplanar graphs
- On the planar split thickness of graphs
- The splitting number of the complete graph
- Face covers and the genus problem for apex graphs
- Cluster graph modification problems
- A new bound on the feedback vertex sets in cubic graphs
- Searching among intervals and compact routing tables
- Connecting face hitting sets in planar graphs
- Planar rectilinear drawings of outerplanar graphs in linear time
- Obtaining a planar graph by vertex deletion
- The Book Embedding Problem from a SAT-Solving Perspective
- Approximation of pathwidth of outerplanar graphs
- On double and multiple interval graphs
- Lower Bounds For Induced Forests in Cubic Graphs
- On the Complexity of Covering Vertices by Faces in a Planar Graph
- Approximation algorithms for NP-complete problems on planar graphs
- Augmenting Outerplanar Graphs
- VERTEX SPLITTING IN DAGS AND APPLICATIONS TO PARTIAL SCAN DESIGNS AND LOSSY CIRCUITS
- Node-and edge-deletion NP-complete problems
- SPLITTING NUMBER is NP-complete
- Complexity classification of some edge modification problems
- Planarizing graphs and their drawings by vertex splitting
- An FPT algorithm for bipartite vertex splitting
- Parameterized Complexity of Vertex Splitting to Pathwidth at Most 1
This page was built for publication: Splitting plane graphs to outerplanarity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6636997)
