Perfect Star Packings in (2,6)-Fullerene Graphs

[1] T. Došlic, Cyclical edge-connectivity of fullerene graphs and (k; 6)-cages, J. Math. Chem. 33 (2003) 103-112, https://doi.org/10.1023/A:1023299815308.

[2] M. T. Dehkordi and G. H. Fath-Tabar, Nice pairs of pentagons in chamfered fullerenes, MATCH Commun. Math. Comput. Chem. 87 (2022) 621-628, https://doi.org/: 10.46793/match.87-3.621T.
[3] T. Došlic, M. T. Dehkordi and G. H. Fath-Tabar, Shortest perfect pseudo matchings in fullerene graphs, Appl. Math. Comput. 424 (2022) #127026, https://doi.org/10.1016/j.amc.2022.127026.
[4] T. Došlic, M. T. Dehkordi and G. H. Fath-Tabar, Packing stars in fullerenes, J. Math. Chem. 58 (2020) 2223-2244, https://doi.org/10.1007/s10910-020-01177-4.
[5] M. T. Dehkordi and G. H. Fath-Tabar, On the number of perfect star packing and perfect pseudo matching in some fullerene graphs, Iranian J. Math. Chem. 14 (2023) 7-18, https://doi.org/10.22052/IJMC.2022.248451.1669.
[6] M. T. Dehkordi, Introducing two transformations in fullerene graphs, star and semi-star, Iranian J. Math. Chem. 14 (2023) 135-143, https://doi.org/10.22052/IJMC.2023.252986.1722.
[7] L. Shi, The fullerene graphs with a perfect star packing, Ars Math. Contemp. 23 (2023) #P1.05, https://doi.org/10.26493/1855-3974.2631.be0.
[8] T. Došlic, On some structural properties of fullerene graphs, J. Math. Chem. 31 (2002) 187-195, https://doi.org/10.1023/A:1016274815398.
[9] M. Ghorbani and E. Naserpour, The clar number of fullerene C24n and carbon nanocobe CNC4[n], Iranian J. Math. Chem. 2 (2011) 53-59, https://doi.org/10.22052/IJMC.2011.5168.
[10] F. Zhang and L. Wang, k-Resonance of open-ended carbon nanotubes, J. Math. Chem. 35 (2004) 87-103,
https://doi.org/10.1023/B:JOMC.0000014306.86197.22.
[11] R. Yang and M. Yuan, The structural properties of (2,6)-fullerenes, Symmetry 15 (2023) #2078, https://doi.org/10.3390/sym15112078.
[12] F. Harary, Graph Theory, Addison-Wesley, Boston, 1969.
[13] L. Lovász and M. D. Plummer, Matching Theory, North-Holland, New York, 1986.
[14] M. D. Plummer, Extending matchings in graphs: a survey, Discrete Math. 127 (1994) 277-292, https://doi.org/10.1016/0012-365X(92)00485-A.
[15] B. Grünbaum and T. S. Motzkin, The number of hexagons and the simplicity of geodesics on certain polyhedra, Canadian J. Math. 15 (1963) 744-751.