Obtaining a planar graph by vertex deletion
From MaRDI portal
Publication:2429328
Recommendations
- Obtaining a Planar Graph by Vertex Deletion
- Decomposing a planar graph into degenerate graphs
- Quickly excluding a planar graph
- scientific article; zbMATH DE number 4068901
- Minimal elimination of planar graphs
- On cleaving a planar graph
- Planarizing graphs and their drawings by vertex splitting
- Modifying a graph using vertex elimination
- Deleting vertices from a 2-connected graph with preserving 2-connectedness
- Reducing the maximum degree of a graph by deleting vertices
Cites work
- scientific article; zbMATH DE number 5485473 (Why is no real title available?)
- scientific article; zbMATH DE number 5485529 (Why is no real title available?)
- scientific article; zbMATH DE number 5764786 (Why is no real title available?)
- scientific article; zbMATH DE number 125608 (Why is no real title available?)
- scientific article; zbMATH DE number 512967 (Why is no real title available?)
- scientific article; zbMATH DE number 1142315 (Why is no real title available?)
- scientific article; zbMATH DE number 2080462 (Why is no real title available?)
- scientific article; zbMATH DE number 1543064 (Why is no real title available?)
- scientific article; zbMATH DE number 1361465 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- An improved algorithm for finding tree decompositions of small width
- Applications of a Planar Separator Theorem
- Approximation algorithms for NP-complete problems on planar graphs
- Chordal deletion is fixed-parameter tractable
- Computing crossing numbers in quadratic time
- Crossing Number is NP-Complete
- Efficient Planarity Testing
- Finding a Maximum Cut of a Planar Graph in Polynomial Time
- Finding odd cycle transversals.
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Graph minors. V. Excluding a planar graph
- Graph minors. XIII: The disjoint paths problem
- Graph minors. XX: Wagner's conjecture
- ON DISJOINT CYCLES
- On search, decision, and the efficiency of polynomial-time algorithms
- Planarity Allowing Few Error Vertices in Linear Time
- Quickly excluding a planar graph
- Subgraph Isomorphism in Planar Graphs and Related Problems
- The graph genus problem is NP-complete
- The node-deletion problem for hereditary properties is NP-complete
- Wheel-Free Deletion Is W[2]-Hard
Cited in
(33)- A deterministic polynomial kernel for odd cycle transversal and vertex multiway cut in planar graphs
- Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable
- Planarizing graphs and their drawings by vertex splitting
- A near-optimal planarization algorithm
- Proper interval vertex deletion
- Parameterized complexity of vertex deletion into perfect graph classes
- The critical node detection problem in networks: a survey
- Faster parameterized algorithms for deletion to split graphs
- Fast partitioning \(l\)-apex graphs with applications to approximating maximum induced-subgraph problems
- Splitting plane graphs to outerplanarity
- The non planar vertex deletion of \(C_n\times C_m\).
- Sublinear approximation algorithms for boxicity and related problems
- \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions
- Modification to Planarity is Fixed Parameter Tractable
- Combing a Linkage in an Annulus
- Modifying a graph using vertex elimination
- A more accurate view of the flat wall theorem
- A tight lower bound for vertex planarization on graphs of bounded treewidth
- Improved kernel and algorithm for claw and diamond free edge deletion based on refined observations
- Faster parameterized algorithms for modification problems to minor-closed classes
- All minor-minimal apex obstructions with connectivity two
- Quadratic vertex kernel for split vertex deletion
- Obtaining a Planar Graph by Vertex Deletion
- Deleting vertices to graphs of bounded genus
- Graph minors and parameterized algorithm design
- Parameterized complexity of finding connected induced subgraphs
- An algorithmic meta-theorem for graph modification to planarity and FOL
- A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs
- scientific article; zbMATH DE number 7525474 (Why is no real title available?)
- Splitting plane graphs to outerplanarity
- What's next? Future directions in parameterized complexity
- Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion
- Computing paths of large rank in planar frameworks deterministically
This page was built for publication: Obtaining a planar graph by vertex deletion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2429328)
