Every tree with n vertices has at least ceil(n/2) maximal matchings, with equality only for certain starlike trees.
Doˇ sli´ c, Saturation number of fullerene graphs, J
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
On the maximal matchings of trees
Every tree with n vertices has at least ceil(n/2) maximal matchings, with equality only for certain starlike trees.