Cyclical edge-connectivity of fullerene graphs and \((k,6)\)-cages
From MaRDI portal
Publication:1397283
DOI10.1023/A:1023299815308zbMath1018.92036MaRDI QIDQ1397283
Publication date: 27 July 2003
Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)
05C90: Applications of graph theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
92E10: Molecular structure (graph-theoretic methods, methods of differential topology, etc.)
Related Items
The isolated-pentagon rule and nice substructures in fullerenes, 𝐵-rigidity of the property to be an almost Pogorelov polytope, On the anti-Kekulé problem of cubic graphs, Cohomological rigidity of manifolds defined by 3-dimensional polytopes, Right-angled polyhedra and hyperbolic 3-manifolds, Fullerenes with the maximum Clar number, At least half of the leapfrog fullerene graphs have exponentially many Hamilton cycles, Distances on nanotubical structures, Hexagonal resonance of (3,6)-fullerenes, 2-resonance of plane bipartite graphs and its applications to boron-nitrogen fullerenes, Maximal resonance of cubic bipartite polyhedral graphs, On forcing matching number of boron-nitrogen fullerene graphs, The anti-Kekulé number of graphs, Nice pairs of disjoint pentagons in fullerene graphs, Nice pairs of odd cycles in fullerene graphs, Packing stars in fullerenes, Finding more perfect matchings in leapfrog fullerenes, Fullerene graphs have exponentially many perfect matchings, Cyclic 7-edge-cuts in fullerene graphs, A note on the cyclical edge-connectivity of fullerene graphs, Leapfrog fullerenes have many perfect matchings, Cyclic edge-cuts in fullerene graphs, On cyclic edge-connectivity of fullerenes, Extremal fullerene graphs with the maximum Clar number, Forcing matching numbers of fullerene graphs, An upper bound for the Clar number of fullerene graphs, Fullerene graphs with exponentially many perfect matchings, On decompositions of leapfrog fullerenes, On the anti-Kekulé number of leapfrog fullerenes, Construction of fullerenes and Pogorelov polytopes with 5-, 6- and one 7-gonal face, Distance-restricted matching extendability of fullerene graphs, On bicriticality of (3,6)-fullerene graphs, Theory of families of polytopes: fullerenes and Pogorelov polytopes, Counting clar structures of \((4,6)\)-fullerenes, Restricted 2-extendability of (3,6)-fullerenes, Cohomological rigidity of families of manifolds associated with ideal right-angled hyperbolic 3-polytopes, Shortest perfect pseudomatchings in fullerene graphs, On the anti-Kekulé number of (4, 5, 6)-fullerenes, On correlation of hyperbolic volumes of fullerenes with their properties, On some structural properties of generalized fullerene graphs with 13 pentagonal faces, Three-dimensional right-angled polytopes of finite volume in the Lobachevsky space: combinatorics and constructions, Packing resonant hexagons in fullerenes, Geometric biplane graphs. I: Maximal graphs, 2-resonant fullerenes, Reducing an arbitrary fullerene to the dodecahedron, On the maximum forcing and anti-forcing numbers of \((4, 6)\)-fullerenes, On the anti-Kekulé number and odd cycle transversal of regular graphs, Characterizing the fullerene graphs with the minimum forcing number 3, Exact square coloring of subcubic planar graphs, Constructions of families of three-dimensional polytopes, characteristic patches of fullerenes, and Pogorelov polytopes, On Certain Graph Theory Applications
