Nice pairs of odd cycles in fullerene graphs

DOI10.1007/S10910-020-01171-WMaRDI QIDQ830896zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• A note on the cyclical edge-connectivity of fullerene graphs
• Bipartizing fullerenes
• Computing the bipartite edge frustration of fullerene graphs
• Cyclic edge-cuts in fullerene graphs
• Cyclical edge-connectivity of fullerene graphs and (k,6)-cages
• Exponentially many perfect matchings in cubic graphs
• Extending matchings in graphs: A survey
• Fullerene graphs have exponentially many perfect matchings
• Fullerene graphs with exponentially many perfect matchings
• Graphs with independent perfect matchings
• How to build a brick
• Matching theory
• Maximum matching and a polyhedron with 0,1-vertices
• New lower bound on the number of perfect matchings in fullerene graphs
• On k-resonant fullerene graphs
• On a conjecture of Lovász concerning bricks. I: The characteristic of a matching covered graph
• On a conjecture of Lovász concerning bricks. II: Bricks of finite characteristic
• On bicriticality of (3,6)-fullerene graphs
• On cyclic edge-connectivity of fullerenes
• On lower bounds of number of perfect matchings in fullerene graphs
• On some structural properties of fullerene graphs
• Optimal ear decompositions of matching covered graphs and bases for the matching lattice
• The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra
• 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
• The perfect matching polytope and solid bricks

Cited in

(7)

• Nice pairs of disjoint pentagons in fullerene graphs
• A note on the cyclical edge-connectivity of fullerene graphs
• Nice pairs of pentagons in chamfered fullerenes
• 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)