Subgraphs of 4-regular planar graphs
Combinatorics
2013-07-23 v1
Abstract
We shall present an algorithm for determining whether or not a given planar graph H can ever be a subgraph of a 4-regular planar graph. The algorithm has running time O(|H|^{2.5}) and can be used to find an explicit 4-regular planar graph G containing H if such a graph exists. It shall not matter whether we specify that H and G must be simple graphs or allow them to be multigraphs.
Keywords
Cite
@article{arxiv.1101.5294,
title = {Subgraphs of 4-regular planar graphs},
author = {Chris Dowden and Louigi Addario-Berry},
journal= {arXiv preprint arXiv:1101.5294},
year = {2013}
}
Comments
21 pages, 19 figures. To be published in Algorithmica