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⊃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.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
Bodirsky, M., Gröpl, C.: Generating labelled planar graphs uniformly at random. Theor. Comput. Sci. 379, 377–386 (2007)
Bodlaender, H.L., Tan, R.B., van Leeuwen, J.: Finding a Δ-regular supergraph of minimum order. Discrete Appl. Math. 131, 3–9 (2007)
Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13, 335–379 (1976)
Dowden, C.: Uniform random planar graphs with degree constraints. PhD thesis (2008). Available at http://ora.ouls.ox.ac.uk
Even, S., Kariv, O.: An O(n 2.5) algorithm for maximum matching in graphs. In: Proceedings of the 16th Annual IEEE Symposium on Foundations of Computer Science, pp. 100–112 (1975)
Gerke, S., McDiarmid, C., Steger, A., Weißl, A.: Random planar graphs with n nodes and a fixed number of edges. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pp. 999–1007 (2005)
Giménez, O., Noy, M.: Asymptotic enumeration and limit laws of planar graphs. J. Am. Math. Soc. 22, 309–329 (2009)
Hopcroft, J.E., Tarjan, R.E.: Dividing a graph into triconnected components. SIAM J. Comput. 2, 135–158 (1973)
McDiarmid, C., Steger, A., Welsh, D.: Random planar graphs. J. Comb. Theory Ser. B 93, 187–205 (2005)
Whitney, H.: 2-isomorphic graphs. Am. J. Math. 55, 245–254 (1933)
About this article
Cite this article
Dowden, C., Addario-Berry, L. Subgraphs of 4-Regular Planar Graphs. Algorithmica 61, 758–776 (2011). https://doi.org/10.1007/s00453-010-9435-8
- Planar graphs
- Subgraph appearance