New upper bounds on the decomposability of planar graphs
From MaRDI portal
(Redirected from Publication:3376690)
Recommendations
- Decomposing planar graphs into graphs with degree restrictions
- scientific article; zbMATH DE number 1501958
- Upper bound of the decomposition dimension of a graph
- A note on edge-decompositions of planar graphs
- Decompositions of quadrangle-free planar graphs
- Degree-constrained decompositions of graphs: Bounded treewidth and planarity
- Decomposing a planar graph into degenerate graphs
- New upper bounds on linear coloring of planar graphs
- Bounds for the decomposition dimension of some class of graphs
- Decomposition of planar graphs with forbidden configurations
Cites work
Cited in
(29)- Computational study on planar dominating set problem
- An efficient polynomial time approximation scheme for the vertex cover \(P_3\) problem on planar graphs
- Computational study on a PTAS for planar dominating set problem
- Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions
- Intersecting longest paths in chordal graphs
- Subexponential parameterized algorithms for bounded-degree connected subgraph problems on planar graphs
- Fixed-parameter tractability of treewidth and pathwidth
- A local search algorithm for branchwidth
- A tree-decomposed transfer matrix for computing exact Potts model partition functions for arbitrary graphs, with applications to planar graph colourings
- Upper Bound Constructions for Untangling Planar Geometric Graphs
- New analysis and computational study for the planar connected dominating set problem
- A Linear Kernel for Planar Feedback Vertex Set
- Subexponential parameterized algorithms
- Coverability and sub-exponential parameterized algorithms in planar graphs
- Surprising Applications of Treewidth Bounds for Planar Graphs
- A subexponential parameterized algorithm for directed subset traveling salesman problem on planar graphs
- Upward book embeddings of st-graphs
- Enumerating grid layouts of graphs
- Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms
- Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms
- NP-completeness results for partitioning a graph into total dominating sets
- Complexity of fall coloring for restricted graph classes
- Transversals of longest cycles in partial k‐trees and chordal graphs
- Upward book embeddability of \(st\)-graphs: complexity and algorithms
- Parameterized and approximation algorithms for the maximum bimodal subgraph problem
- On the minimum corridor connection problem and other generalized geometric problems
- Practical algorithms for branch-decompositions of planar graphs
- Computing branchwidth via efficient triangulations and blocks
- Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
This page was built for publication: New upper bounds on the decomposability of planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3376690)
