Nice pairs of odd cycles in fullerene graphs
From MaRDI portal
Publication:830896
DOI10.1007/s10910-020-01171-wzbMath1466.92257OpenAlexW3085875984MaRDI QIDQ830896
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
Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)
Related Items (2)
Nice pairs of disjoint pentagons in fullerene graphs ⋮ Shortest perfect pseudomatchings in fullerene graphs
Cites Work
- Unnamed Item
- Bipartizing fullerenes
- Exponentially many perfect matchings in cubic graphs
- The perfect matching polytope and solid bricks
- Fullerene graphs have exponentially many perfect matchings
- A note on the cyclical edge-connectivity of fullerene graphs
- Cyclic edge-cuts in fullerene graphs
- On cyclic edge-connectivity of fullerenes
- Fullerene graphs with exponentially many perfect matchings
- Matching theory
- On lower bounds of number of perfect matchings in fullerene graphs
- Extending matchings in graphs: A survey
- Cyclical edge-connectivity of fullerene graphs and \((k,6)\)-cages
- New lower bound on the number of perfect matchings in fullerene graphs
- On some structural properties of fullerene graphs
- On bicriticality of (3,6)-fullerene graphs
- 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
- On a conjecture of Lovász concerning bricks. II: Bricks of finite characteristic
- Computing the bipartite edge frustration of fullerene graphs
- How to build a brick
- The chirality of icosahedral fullerenes: a comparison of the tripling (leapfrog), quadrupling (chamfering), and septupling (capra) transformations
- Graphs with independent perfect matchings
- Onk-Resonant Fullerene Graphs
- The isolated-pentagon rule and nice substructures in fullerenes
- Maximum matching and a polyhedron with 0,1-vertices
- The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra
This page was built for publication: Nice pairs of odd cycles in fullerene graphs
