Trees with maximum number of maximal matchings

DOI10.1016/j.disc.2005.11.074zbMath1116.05039OpenAlexW2047165481MaRDI QIDQ878628

Joanna Górska, Zdzisław Skupień

Publication date: 26 April 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.11.074

zbMATH Keywords

treeenumerationforestcharacterization of structure

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (6)

The number of maximum matchings in a tree ⋮ Counting the maximal and perfect matchings in benzenoid chains ⋮ Maximal independent sets and maximal matchings in series-parallel and related graph classes ⋮ Maximal independent sets and maximal matchings in series-parallel and related graph classes ⋮ Trees with minimum number of infima closed sets ⋮ Maximal matchings in polyspiro and benzenoid chains

Cites Work

• Matching theory
• The number of maximal independent sets in a connected graph
• Le nombre maximum de cliques et de recouvrements par cliques des hypergraphes chromatiques complets
• A finiteness theorem for maximal independent sets
• Maximal independent sets in bipartite graphs
• The Number of Maximal Independent Sets in a Tree
• A Note on Independent Sets in Trees
• The number of maximal independent sets in connected graphs
• The structure and maximum number of maximum independent sets in trees
• The Number of Maximal Independent Sets in Triangle-Free Graphs
• On cliques in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Trees with maximum number of maximal matchings