The product structure of squaregraphs
From MaRDI portal
Publication:6143380
DOI10.1002/jgt.23008arXiv2203.03772MaRDI QIDQ6143380
Laura Merker, Paul Jungeblut, Robert Hickingbotham, David R. Wood
Publication date: 24 January 2024
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.03772
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Unnamed Item
- Nonrepetitive colorings of graphs of bounded tree-width
- Track layouts, layered path decompositions, and leveled planarity
- Nonrepetitive graph colouring
- An improved planar graph product structure theorem
- Parameters Tied to Treewidth
- Combinatorics and Geometry of Finite and Infinite Squaregraphs
- On the Genus of Strong Tensor Products of Graphs
- Nonrepetitive colorings of graphs
- 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
- Separating layered treewidth and row treewidth
- Improved product structure for graphs on surfaces
- Induced subgraphs of product graphs and a generalization of Huang's theorem
This page was built for publication: The product structure of squaregraphs
