The independence numbers of fullerenes and benzenoids
From MaRDI portal
Publication:2493105
DOI10.1016/j.ejc.2005.05.002zbMath1088.05070MaRDI QIDQ2493105
Publication date: 9 June 2006
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2005.05.002
05C90: Applications of graph theory
92E10: Molecular structure (graph-theoretic methods, methods of differential topology, etc.)
Related Items
Long cycles in fullerene graphs, Kekulé structures and the face independence number of a fullerene, Saturation number of fullerene graphs, Leapfrog fullerenes have many perfect matchings, Cyclic edge-cuts in fullerene graphs, On cyclic edge-connectivity of fullerenes, A mathematical programming model for computing the fries number of a fullerene, Packing resonant hexagons in fullerenes, Computing the bipartite edge frustration of fullerene graphs
Cites Work