Generating all 3-connected 4-regular planar graphs from the octahedron graph

Broersma, H.J. and Duijvestijn, A.J.W. and Göbel, F. (1993) Generating all 3-connected 4-regular planar graphs from the octahedron graph. Journal of Graph Theory, 17 (5). pp. 613-620. ISSN 0364-9024

Preview

PDF
370Kb

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 operation we obtain an alternative to a procedure by Lehel to generate all connected 4-regular planar graphs from the Octahedron Graph.
Item Type:	Article
Copyright:	© 1993 Wiley InterScience
Faculty:	Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:	Discrete Mathematics and Mathematical Programming (DMMP)
Link to this item:	http://purl.utwente.nl/publications/70999
Official URL:	http://dx.doi.org/10.1002/jgt.3190170508
Export this item as:	BibTeX EndNote HTML Citation Reference Manager

Show download statistics for this publication

Repository Staff Only: item control page

Metis ID: 1400354