Recommendations
Cites work
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- A computer-assisted proof of the Barnette-Goodey conjecture: not only fullerene graphs are Hamiltonian
- Block allocation of a sequential resource
- Cyclical edge-connectivity of fullerene graphs and \((k,6)\)-cages
- Induced \(H\)-packing \(k\)-partition number for certain nanotubes and chemical graphs
- Matching theory
- New lower bound on the number of perfect matchings in fullerene graphs
- Note on the asymptotic isomer count of large fullerenes
- Number of matchings of low order in (4,6)-Fullerene graphs
- On lower bounds of number of perfect matchings in fullerene graphs
- On some structural properties of fullerene graphs
- On the number of Kekulé structures in capped zigzag nanotubes
- Polynomial-time data reduction for dominating set
- 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
Cited in
(9)- Packing 2- and 3-stars into \(( 2 , 3 )\)-regular graphs
- The spectrum of the vertex quadrangulation of a 4-regular toroidal graph and beyond
- Covering automorphisms and some eigenvalues of a graph
- On the number of perfect star packing and perfect pseudo matching in some fullerene graphs
- On a variant of Flory model
- scientific article; zbMATH DE number 6511304 (Why is no real title available?)
- The fullerene graphs with a perfect star packing
- scientific article; zbMATH DE number 4180219 (Why is no real title available?)
- Shortest perfect pseudomatchings in fullerene graphs
This page was built for publication: Packing stars in fullerenes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q830899)
