For k = 0, 1, 2, 3, 4, 5, let Pk be the class of k-edge-connected 5-regular planar graphs. In this paper, graph operations are introduced that generate all graphs in each Pk. © 2009 Wiley Periodicals, Inc.
Publication Source (Journal or Book title)
Journal of Graph Theory
Ding, G., Kanno, J., & Su, J. (2009). Generating 5-regular planar graphs. Journal of Graph Theory, 61 (3), 219-240. https://doi.org/10.1002/jgt.20377