An improved planar graph product structure theorem

DOI10.37236/10614OpenAlexW3188704289WikidataQ113693648 ScholiaQ113693648MaRDI QIDQ2152790

David R. Wood, Wendy Yi, Torsten Ueckerdt

Publication date: 11 July 2022

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2108.00198

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph operations (line graphs, products, etc.) (05C76)

Related Items (7)

Bounding twin-width for bounded-treewidth graphs, planar graphs, and bipartite graphs ⋮ Sparse universal graphs for planarity ⋮ Shallow Minors, Graph Products, and Beyond-Planar Graphs ⋮ The product structure of squaregraphs ⋮ Graph product structure for non-minor-closed classes ⋮ Linear layouts of bipartite planar graphs ⋮ Shorter Labeling Schemes for Planar Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Apollonian ball packings and stacked polytopes
• A partial k-arboretum of graphs with bounded treewidth
• Polynomial bounds for centered colorings on proper minor-closed graph classes
• Subclasses of \(k\)-trees: characterization and recognition
• Parameters Tied to Treewidth
• Characterization and Recognition of Partial 3-Trees
• Graph minors. II. Algorithmic aspects of tree-width
• Some Properties of Random Apollonian Networks
• Adjacency Labelling for Planar Graphs (and Beyond)
• Planar graphs have bounded nonrepetitive chromatic number
• Planar Graphs Have Bounded Queue-Number
• Shorter Labeling Schemes for Planar Graphs
• Improved Bounds for Centered Colorings
• Clustered 3-colouring graphs of bounded degree
• Proofs from THE BOOK
• Separating layered treewidth and row treewidth

This page was built for publication: An improved planar graph product structure theorem