Construction of planar triangulations with minimum degree 5

DOI10.1016/J.DISC.2005.06.019MaRDI QIDQ2581624zbMATH OpenOpenAlexFDO

Authors 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

Cubic graphFullereneGeneration

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3843770
• scientific article; zbMATH DE number 5005324
• Fast generation of planar graphs
• Fast generation of some classes of planar graphs
• scientific article; zbMATH DE number 558327

Cites work

• A Generation Procedure for the Simple 3-Polytopes With Cyclically 5-Connected Graphs
• Convex Polytopes
• Counting 5-connected planar triangulations
• scientific article; zbMATH DE number 3843770 (Why is no real title available?)
• scientific article; zbMATH DE number 3509333 (Why is no real title available?)
• Isomorph-Free Exhaustive Generation
• Nonhamiltonian 3-Connected Cubic Planar Graphs
• On generating planar graphs
• Polyhedra of small order and their Hamiltonian properties

Cited in

(19)

• Construction of fullerenes and Pogorelov polytopes with 5-, 6- and one 7-gonal face
• All quadrilateral-wheel planar Ramsey numbers
• Extremal families of redundantly rigid graphs in three dimensions
• Complete graph-tree planar Ramsey numbers
• Kempe-locking configurations
• Geometric biplane graphs. II: Graph augmentation
• Structural and computational results on platypus graphs
• Coxeter groups, hyperbolic cubes and acute triangulations
• Planar Hypohamiltonian Graphs on 40 Vertices
• scientific article; zbMATH DE number 3843770 (Why is no real title available?)
• Recursive Generation of 5-Regular Planar Graphs
• Generating 4-connected even triangulations on the sphere
• Wiener Index and Remoteness in Triangulations and Quadrangulations
• Construction of acyclically 4-colourable planar triangulations with minimum degree 4
• Proximity in triangulations and quadrangulations
• Hypohamiltonian planar cubic graphs with girth 5
• Transformations for maximal planar graphs with minimum degree five
• A new note on 1-planar graphs with minimum degree 7
• On cyclic edge-connectivity of fullerenes

Describes a project that uses

Uses Software

• plantri

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2581624)