Product structure of graph classes with strongly sublinear separators
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3917707 (Why is no real title available?)
- scientific article; zbMATH DE number 1375581 (Why is no real title available?)
- scientific article; zbMATH DE number 3752239 (Why is no real title available?)
- A Separator Theorem for Nonplanar Graphs
- A Separator Theorem for Planar Graphs
- A partial k-arboretum of graphs with bounded treewidth
- A separator theorem for graphs of bounded genus
- Adjacency Labelling for Planar Graphs (and Beyond)
- Algorithms for graphs embeddable with few crossings per edge
- An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\)
- An improved planar graph product structure theorem
- Applications of a Planar Separator Theorem
- Bounding twin-width for bounded-treewidth graphs, planar graphs, and bipartite graphs
- Computing straight-line 3D grid drawings of graphs in linear volume
- Defective and clustered graph colouring
- Defective colouring of graphs excluding a subgraph or minor
- Distinct distances in graph drawings
- Domino Treewidth
- Edge-isoperimetric inequalities in the grid
- Fan-planar graphs
- Fractional colouring and Hadwiger's conjecture
- Gap-planar graphs
- Geometric separator theorems and applications
- Graph colouring with no large monochronomatic components
- Graph drawings with few slopes
- Graph minor hierarchies
- Graph minors. II. Algorithmic aspects of tree-width
- Graph minors. V. Excluding a planar graph
- Graph product structure for \(h\)-framed graphs
- Graph product structure for non-minor-closed classes
- Graphs on surfaces
- Improved bounds for centered colorings
- Improved product structure for graphs on surfaces
- Layered separators in minor-closed graph classes with applications
- Layout of Graphs with Bounded Tree-Width
- Logical aspects of Cayley-graphs: the group case
- New upper bounds on harmonious colorings
- Notes on nonrepetitive graph colouring
- On Comparable Box Dimension
- On the parameterized complexity of computing tree-partitions
- On the presence of disjoint subgraphs of a specified type
- On tree-partition-width
- On tree-partitions of graphs
- On weighted sublinear separators
- Packing and covering immersion models of planar subcubic graphs
- Partitioning graphs of bounded tree-width
- Partitioning into graphs with only small components
- Planar decompositions and the crossing number of graphs with an excluded minor
- Planar graphs have bounded nonrepetitive chromatic number
- Planar graphs have bounded queue-number
- Powers of planar graphs, product structure, and blocking partitions
- Product structure extension of the Alon-Seymour-Thomas theorem
- Product structure of graph classes with bounded treewidth
- Product structure of graphs with an excluded minor
- Quotient Networks
- Quotient tree partitioning of undirected graphs
- Recent techniques and results on the Erdős-Pósa property
- Separators for sphere-packings and nearest neighbor graphs
- Separators in region intersection graphs
- Shallow Minors, Graph Products, and Beyond-Planar Graphs
- Simulation of large networks on smaller networks
- Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond
- Some results on tree decomposition of graphs
- Sparse universal graphs for planarity
- Sparsity. Graphs, structures, and algorithms
- Structure of graphs with locally restricted crossings
- Sublinear separators in intersection graphs of convex shapes
- Surfaces, tree-width, clique-minors, and partitions
- The complexity of finding uniform emulations on fixed graphs
- The complexity of finding uniform emulations on paths and ring networks
- The density of fan-planar graphs
- Tree-partitions of infinite graphs
- Tree-partitions with bounded degree trees
- Treewidth of graphs with balanced separations
- Vertex partitions of chordal graphs
This page was built for publication: Product structure of graph classes with strongly sublinear separators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6924047)
