Saturation number of fullerene graphs

DOI10.1007/s10910-006-9217-3zbMath1162.92339OpenAlexW2136499357MaRDI QIDQ937610

Tomislav Došlić

Publication date: 15 August 2008

Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10910-006-9217-3

zbMATH Keywords

maximal matchingsaturation number

Mathematics Subject Classification ID

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

Related Items (6)

Smallest maximal matchings of graphs ⋮ Counting the maximal and perfect matchings in benzenoid chains ⋮ Saturation number of lattice animals ⋮ Long cycles in fullerene graphs ⋮ Block allocation of a sequential resource ⋮ Maximal matchings in polyspiro and benzenoid chains

Cites Work

• On lower bounds of number of perfect matchings in fullerene graphs
• Small maximal matchings in random graphs.
• New lower bound on the number of perfect matchings in fullerene graphs
• On some structural properties of fullerene graphs
• Independence number in \(n\)-extendable graphs
• The independence numbers of fullerenes and benzenoids
• Edge Dominating Sets in Graphs
• An Analysis of the Greedy Heuristic for Independence Systems
• Paths, Trees, and Flowers
• The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Saturation number of fullerene graphs