Long cycles in fullerene graphs
From MaRDI portal
Publication:5902228
DOI10.1007/s10910-008-9495-zzbMath1196.92049MaRDI QIDQ5902228
František Kardoš, Rok Erman, Jozef Miškuf
Publication date: 16 November 2009
Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10910-008-9495-z
05C90: Applications of graph theory
92E10: Molecular structure (graph-theoretic methods, methods of differential topology, etc.)
Cites Work
- Unnamed Item
- Unnamed Item
- On shortness exponents of families of graphs
- Fullerene graphs have exponentially many perfect matchings
- Saturation number of fullerene graphs
- Non-Hamiltonian simple 3-polytopes having just two types of faces
- The existence of certain planar maps
- Hamiltonian circuits in polytopes with even sided faces
- On lower bounds of number of perfect matchings in fullerene graphs
- Longest cycles in generalized Buckminsterfullerene graphs
- New lower bound on the number of perfect matchings in fullerene graphs
- On some structural properties of fullerene graphs
- The independence numbers of fullerenes and benzenoids
- A class of Hamiltonian polytopes
- Long cycles in fullerene graphs