Structural properties of graph products
From MaRDI portal
Cites work
- A partial k-arboretum of graphs with bounded treewidth
- Adjacency Labelling for Planar Graphs (and Beyond)
- An extremal function for contractions of graphs
- An improved planar graph product structure theorem
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- Bandwidth and pathwidth of three-dimensional grids
- Bandwidth of the Cartesian product of two connected graphs
- Boxicity and cubicity of product graphs
- Clique minors in Cartesian products of graphs
- Coloring graph products---a survey
- Connectivity of Cartesian product graphs
- Connectivity of Cartesian products of graphs
- Contractions of graphs: A theorem of Ore and an extremal problem
- Counterexamples to Hedetniemi's conjecture
- Edge-connectivity of strong products of graphs
- Graph minor hierarchies
- Graph minors. I. Excluding a forest
- Graph minors. II. Algorithmic aspects of tree-width
- Graph product structure for non-minor-closed classes
- Graph searching and a min-max theorem for tree-width
- scientific article; zbMATH DE number 3865318 (Why is no real title available?)
- scientific article; zbMATH DE number 5016629 (Why is no real title available?)
- scientific article; zbMATH DE number 4075102 (Why is no real title available?)
- scientific article; zbMATH DE number 3739563 (Why is no real title available?)
- scientific article; zbMATH DE number 3506744 (Why is no real title available?)
- scientific article; zbMATH DE number 3616459 (Why is no real title available?)
- scientific article; zbMATH DE number 1222090 (Why is no real title available?)
- scientific article; zbMATH DE number 566078 (Why is no real title available?)
- scientific article; zbMATH DE number 1057879 (Why is no real title available?)
- scientific article; zbMATH DE number 4121438 (Why is no real title available?)
- scientific article; zbMATH DE number 7788455 (Why is no real title available?)
- Improved bounds for centered colorings
- Improved product structure for graphs on surfaces
- Lower bound of the Hadwiger number of graphs by their average degree
- Lower bounds for treewidth of product graphs
- Minors and strong products
- Moore graphs and beyond: a survey of the degree/diameter problem
- Note on Hedetniemi's conjecture and the Poljak-Rödl function
- Notes on graph product structure theory
- On an isoperimetric problem for Hamming graphs
- On some extremal problems in graph theory
- On the bandwidth of a Hamming graph
- On the chromatic number of the product of graphs
- On the connectivity of the direct product of graphs
- On the Hadwiger's conjecture for graph products
- On the presence of disjoint subgraphs of a specified type
- On the treewidth of Hanoi graphs
- Optimal Indexing of the Vertices of Graphs
- Optimal labelling of a product of two paths
- Optimal numberings and isoperimetric problems on graphs
- Parameters tied to treewidth
- Planar graphs have bounded nonrepetitive chromatic number
- Planar graphs have bounded queue-number
- Polynomial treewidth forces a large grid-like-minor
- Queue layouts of graph products and powers
- Quickly excluding a forest
- Shorter Labeling Schemes for Planar Graphs
- Some remarks on the Kronecker product of graphs
- Stack-number is not bounded by queue-number
- The extremal function for complete minors
- The product structure of squaregraphs
- The treewidth and pathwidth of hypercubes
- Thinness of product graphs
- Three-dimensional graph products with unbounded stack-number
- Treewidth and logical definability of graph products
- Treewidth of Cartesian products of highly connected graphs
- Twin-width. II: Small classes
- Vertex-transitive graphs
Cited in
(3)
This page was built for publication: Structural properties of graph products
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6994448)
