Product structure of graph classes with bounded treewidth
From MaRDI portal
Recommendations
Cites work
- A partial k-arboretum of graphs with bounded treewidth
- Adjacency Labelling for Planar Graphs (and Beyond)
- An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\)
- An extremal function for contractions of graphs
- An improved linear edge bound for graph linkages
- An improved planar graph product structure theorem
- Bad News for Chordal Partitions
- Cliques in graphs excluding a complete graph minor
- Clustered colouring in minor-closed classes
- Colouring planar graphs with three colours and no large monochromatic components
- 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
- Dense graphs have \(K_{3,t}\) minors
- Distinct distances in graph drawings
- Domino Treewidth
- Excluding any graph as a minor allows a low tree-width 2-coloring
- Forcing a sparse minor
- Forcing unbalanced complete bipartite minors
- Fractional colouring and Hadwiger's conjecture
- Graph drawings with few slopes
- Graph minor hierarchies
- Graph minors. II. Algorithmic aspects of tree-width
- Graph minors. III. Planar tree-width
- Graph product structure for h-framed graphs
- Graph product structure for non-minor-closed classes
- Graph theory
- Graphs on surfaces
- scientific article; zbMATH DE number 3865318 (Why is no real title available?)
- 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 475582 (Why is no real title available?)
- scientific article; zbMATH DE number 1944139 (Why is no real title available?)
- Improper colourings inspired by Hadwiger's conjecture
- Improved bounds for centered colorings
- Improved product structure for graphs on surfaces
- Layout of Graphs with Bounded Tree-Width
- Logical aspects of Cayley-graphs: the group case
- Lower bound of the Hadwiger number of graphs by their average degree
- Moore graphs and beyond: a survey of the degree/diameter problem
- Notes on nonrepetitive graph colouring
- On \(K_{s,t}\)-minors in graphs with given average degree
- On \(K_{s,t}\)-minors in graphs with given average degree. II
- On Comparable Box Dimension
- On the generalised colouring numbers of graphs that exclude a fixed minor
- On tree-partition-width
- On tree-partitions of graphs
- Packing and covering immersion models of planar subcubic graphs
- Parameters tied to treewidth
- 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
- Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
- Quotient Networks
- Quotient tree partitioning of undirected graphs
- Sachs' linkless embedding conjecture
- Shallow Minors, Graph Products, and Beyond-Planar Graphs
- Simulation of large networks on smaller networks
- Some results on tree decomposition of graphs
- Sparse universal graphs for planarity
- Sparsity. Graphs, structures, and algorithms
- 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 extremal function for complete minors
- The Size Ramsey Number of Graphs with Bounded Treewidth
- Tree-partitions of infinite graphs
- Tree-width and planar minors
- Tree-width dichotomy
- Vertex partitions of chordal graphs
Cited in
(7)- 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
- Product structure of graph classes with strongly sublinear separators
- Powers of planar graphs, product structure, and blocking partitions
- A product structure for planar graphs
- Recognizing 2-layer and outer k-planar graphs
This page was built for publication: Product structure of graph classes with bounded treewidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6632809)
