Construction of planar triangulations with minimum degree 5

DOI10.1016/j.disc.2005.06.019zbMath1078.05022OpenAlexW2126880558MaRDI QIDQ2581624

Gunnar Brinkmann, Brendan D. McKay

Publication date: 10 January 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.06.019

zbMATH Keywords

GenerationCubic graphFullerene

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (17)

Construction of acyclically 4-colourable planar triangulations with minimum degree 4 ⋮ Proximity in triangulations and quadrangulations ⋮ Construction of fullerenes and Pogorelov polytopes with 5-, 6- and one 7-gonal face ⋮ Structural and computational results on platypus graphs ⋮ Planar Hypohamiltonian Graphs on 40 Vertices ⋮ A new note on 1-planar graphs with minimum degree 7 ⋮ Generating 4-connected even triangulations on the sphere ⋮ On cyclic edge-connectivity of fullerenes ⋮ All quadrilateral-wheel planar Ramsey numbers ⋮ Recursive Generation of 5-Regular Planar Graphs ⋮ Coxeter groups, hyperbolic cubes and acute triangulations ⋮ Complete graph-tree planar Ramsey numbers ⋮ Wiener Index and Remoteness in Triangulations and Quadrangulations ⋮ Extremal families of redundantly rigid graphs in three dimensions ⋮ Kempe-locking configurations ⋮ Geometric biplane graphs. II: Graph augmentation ⋮ Hypohamiltonian Planar Cubic Graphs with Girth 5

Uses Software

• plantri

Cites Work

• Unnamed Item
• Unnamed Item
• Polyhedra of small order and their Hamiltonian properties
• On generating planar graphs
• Counting 5-connected planar triangulations
• Isomorph-Free Exhaustive Generation
• Convex Polytopes
• Nonhamiltonian 3-Connected Cubic Planar Graphs
• A Generation Procedure for the Simple 3-Polytopes With Cyclically 5-Connected Graphs

This page was built for publication: Construction of planar triangulations with minimum degree 5