Nice pairs of odd cycles in fullerene graphs

DOI10.1007/S10910-020-01171-WzbMATH Open1466.92257OpenAlexW3085875984MaRDI QIDQ830896FDOQ830896

Authors: Tomislav Došlić 

Publication date: 10 May 2021

Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10910-020-01171-w

Recommendations

• Nice pairs of disjoint pentagons in fullerene graphs
• Nice pairs of pentagons in chamfered fullerenes
• New lower bound on the number of perfect matchings in fullerene graphs
• Shortest perfect pseudomatchings in fullerene graphs
• Distance-restricted matching extendability of fullerene graphs

zbMATH Keywords

perfect matchingodd cyclefullerene graph(3, 6)-fullereneaddition patternnice subgraph

Mathematics Subject Classification ID

Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)

Cites Work

• Matching theory
• Optimal ear decompositions of matching covered graphs and bases for the matching lattice
• On a conjecture of Lovász concerning bricks. I: The characteristic of a matching covered graph
• Graphs with independent perfect matchings
• Maximum matching and a polyhedron with 0,1-vertices
• Title not available (Why is that?)
• Computing the bipartite edge frustration of fullerene graphs
• On \(k\)-resonant fullerene graphs
• Exponentially many perfect matchings in cubic graphs
• Cyclical edge-connectivity of fullerene graphs and \((k,6)\)-cages
• Extending matchings in graphs: A survey
• On some structural properties of fullerene graphs
• The perfect matching polytope and solid bricks
• Cyclic edge-cuts in fullerene graphs
• On cyclic edge-connectivity of fullerenes
• On lower bounds of number of perfect matchings in fullerene graphs
• Bipartizing fullerenes
• The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra
• Fullerene graphs have exponentially many perfect matchings
• How to build a brick
• New lower bound on the number of perfect matchings in fullerene graphs
• On a conjecture of Lovász concerning bricks. II: Bricks of finite characteristic
• Fullerene graphs with exponentially many perfect matchings
• On bicriticality of (3,6)-fullerene graphs
• The chirality of icosahedral fullerenes: a comparison of the tripling (leapfrog), quadrupling (chamfering), and septupling (capra) transformations
• The isolated-pentagon rule and nice substructures in fullerenes
• A note on the cyclical edge-connectivity of fullerene graphs

Cited In (6)

• Nice pairs of disjoint pentagons in fullerene graphs
• A note on the cyclical edge-connectivity of fullerene graphs
• Cyclic 7-edge-cuts in fullerene graphs
• Cyclic edge-cuts in fullerene graphs
• Shortest perfect pseudomatchings in fullerene graphs
• Odd Cycle Transversals and Independent Sets in Fullerene Graphs

This page was built for publication: Nice pairs of odd cycles in fullerene graphs

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