Sandwiching saturation number of fullerene graphs

zbMath1462.05291arXiv1405.2197MaRDI QIDQ5279121

František Kardoš, Vesna Andova, Riste Škrekovski

Publication date: 19 July 2017

Full work available at URL: https://arxiv.org/abs/1405.2197

zbMATH Keywords

smallest maximal matching3-connected cubic planar graphssaturation number of a graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)

Related Items (8)

Distances on nanotubical structures ⋮ Smallest maximal matchings of graphs ⋮ Counting the maximal and perfect matchings in benzenoid chains ⋮ Saturation number of lattice animals ⋮ Leapfrog fullerenes and Wiener index ⋮ Block allocation of a sequential resource ⋮ On some parameters related to matching of graph powers ⋮ Maximal matchings in polyspiro and benzenoid chains

This page was built for publication: Sandwiching saturation number of fullerene graphs