Saturation number of lattice animals

DOI10.26493/1855-3974.1279.bcezbMath1406.92751OpenAlexW2885262779WikidataQ129391455 ScholiaQ129391455MaRDI QIDQ4615062

Tomislav Došlić, Niko Tratnik, Petra Žigert Pleteršek

Publication date: 1 February 2019

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.26493/1855-3974.1279.bce

zbMATH Keywords

maximal matchingsaturation numberpolyomino graphlattice animalbenzenoid graphcoronene

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) 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)

Cites Work

• Unnamed Item
• Unnamed Item
• Saturation number of fullerene graphs
• Small maximal matchings in random graphs.
• Counting maximal matchings in linear polymers
• Matchings in m-generalized fullerene graphs
• Sandwiching saturation number of fullerene graphs
• Saturation number of nanotubes

This page was built for publication: Saturation number of lattice animals