GENERATING ALL 3-CONNECTED 4-REGULAR PLANAR GRAPHS FROM THE OCTAHEDRON GRAPH

Authors
BROERSMA HJ DUIJVESTIJN AJW GOBEL F
Citation
Hj. Broersma et al., GENERATING ALL 3-CONNECTED 4-REGULAR PLANAR GRAPHS FROM THE OCTAHEDRON GRAPH, Journal of graph theory, 17(5), 1993, pp. 613-620
Citations number
10
Categorie Soggetti
Mathematics, Pure",Mathematics
Journal title
Journal of graph theory → ACNP
ISSN journal
03649024
Volume
17
Issue
5
Year of publication
1993
Pages
613 - 620
Database
ISI
SICI code
0364-9024(1993)17:5<613:GA34PG>2.0.ZU;2-G
Abstract
We prove that all 3-connected 4-regular planar graphs can be generated from the Octahedron Graph, using three operations. We generated these graphs up to 15 vertices inclusive. Moreover, by including a fourth o peration we obtain an alternative to a procedure by Lehel to generate all connected 4-regular planar graphs from the Octahedron Graph. (C) 1 993 John Wiley & Sons, Inc.