The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra

DOI10.4153/CJM-1963-071-3zbMath0121.37605OpenAlexW2329714975MaRDI QIDQ5733084

Branko Grünbaum, Theodore S. Motzkin

Publication date: 1963

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4153/cjm-1963-071-3

zbMATH Keywords

elementary geometry

Related Items (55)

Nice pairs of disjoint pentagons in fullerene graphs ⋮ Nice pairs of odd cycles in fullerene graphs ⋮ Packing stars in fullerenes ⋮ Planar bipartite biregular degree sequences ⋮ Computing the bipartite edge frustration of fullerene graphs ⋮ Finding more perfect matchings in leapfrog fullerenes ⋮ Shortest perfect pseudomatchings in fullerene graphs ⋮ The fullerene graphs with a perfect star packing ⋮ Planar graphs with few vertices of small degree ⋮ The maximum sum of degrees above a threshold in planar graphs ⋮ Construction of fullerenes and Pogorelov polytopes with 5-, 6- and one 7-gonal face ⋮ Polytopes, graphs, and complexes ⋮ Characterizing the fullerene graphs with the minimum forcing number 3 ⋮ Reducing an arbitrary fullerene to the dodecahedron ⋮ Sizes of pentagonal clusters in fullerenes ⋮ Some aspects of the symmetry and topology of possible carbon allotrope structures ⋮ Face-spiral codes in cubic polyhedral graphs with face sizes no larger than 6 ⋮ Sharp upper bounds on the Clar number of fullerene graphs ⋮ Hexagonal resonance of (3,6)-fullerenes ⋮ Zigzag structure of thin chamber complexes ⋮ Buckling patterns of shells and spherical honeycomb structures ⋮ The isolated-pentagon rule and nice substructures in fullerenes ⋮ Saturation number of fullerene graphs ⋮ On bicriticality of (3,6)-fullerene graphs ⋮ Leapfrog fullerenes have many perfect matchings ⋮ On correlation of hyperbolic volumes of fullerenes with their properties ⋮ Filling of a given boundary by \(p\)-gons and related problems ⋮ On Face-Vectors and Vertex-Vectors of Cell-Decompositions of Orientable 2-Manifolds ⋮ Fullerenes, polyhedra, and Chinese guardian lions ⋮ Planar graphs and greatest common subgraphs ⋮ Forcing matching numbers of fullerene graphs ⋮ The existence of certain planar maps ⋮ The energies of (3,6)-fullerenes and nanotori ⋮ Cyclic edge and cyclic vertex connectivity of \((4, 5, 6)\)-fullerene graphs ⋮ Asymptotic enumeration of perfect matchings in \(m\)-barrel fullerene graphs ⋮ On quadrangular convex 3-polytopes with at most two types of edges ⋮ Über 3-realisierbare Folgen mit beliebigen Sechseckzahlen ⋮ Restricted 2-extendability of (3,6)-fullerenes ⋮ A class of Hamiltonian polytopes ⋮ On Certain Graph Theory Applications ⋮ A mathematical programming model for computing the fries number of a fullerene ⋮ Unnamed Item ⋮ Fullerenes with the maximum Clar number ⋮ Quantum walks as thermalisations, with application to fullerene graphs ⋮ Some analogues of Eberhard's theorem on convex polytopes ⋮ Unnamed Item ⋮ Fullerene graphs with exponentially many perfect matchings ⋮ Connected sums of \(z\)-knotted triangulations ⋮ Shortness exponents of families of graphs ⋮ Spectra of toroidal graphs ⋮ Inner diagonals of convex polytopes ⋮ On cubic polyhedral graphs with prescribed adjacency properties of their faces ⋮ On the simplicial 3-polytopes with only two types of edges ⋮ Constructions of families of three-dimensional polytopes, characteristic patches of fullerenes, and Pogorelov polytopes ⋮ Fullerenes and disk-fullerenes

This page was built for publication: The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra