The product structure of squaregraphs
Combinatorics
2022-03-09 v1
Abstract
A squaregraph is a plane graph in which each internal face is a -cycle and each internal vertex has degree at least 4. This paper proves that every squaregraph is isomorphic to a subgraph of the semi-strong product of an outerplanar graph and a path. We generalise this result for infinite squaregraphs, and show that this is best possible in the sense that "outerplanar graph" cannot be replaced by "forest".
Cite
@article{arxiv.2203.03772,
title = {The product structure of squaregraphs},
author = {Robert Hickingbotham and Paul Jungeblut and Laura Merker and David R. Wood},
journal= {arXiv preprint arXiv:2203.03772},
year = {2022}
}