On the number of matchings of a tree
From MaRDI portal
Publication:875067
DOI10.1016/J.EJC.2006.01.014zbMATH Open1119.05024OpenAlexW2009228151MaRDI QIDQ875067FDOQ875067
Publication date: 10 April 2007
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2006.01.014
Trees (05C05) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Singularity Analysis of Generating Functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finite range random walk on free groups and homogeneous trees
- Asymptotic Methods in Enumeration
- Coloring rules for finite trees, and probabilities of monadic second order sentences
- On an asymptotic method in enumeration
- Twelve countings with rooted plane trees
- Counting rooted trees: the universal law \(t(n)\sim C\rho^{-n} n^{-3/2}\)
- Title not available (Why is that?)
- On maximal independent sets of nodes in trees
- Central and local limit theorems applied to asymptotic enumeration. II: Multivariate generating functions
- Remarks on an asymptotic method in combinatorics
- The number of trees with a 1-factor
- Trees with 1-factors and oriented trees
- Addendum to: Twelve countings with rooted plane trees
- Title not available (Why is that?)
Cited In (12)
- Title not available (Why is that?)
- Trees with maximum number of maximal matchings
- Title not available (Why is that?)
- A central limit theorem for almost local additive tree functionals
- Maximal matchings in polyspiro and benzenoid chains
- Extremal graphs for average sizes of maximal matchings
- Matchings on trees and the adjacency matrix: A determinantal viewpoint
- Alternating Whitney sums and matchings in trees. 1
- On the number of \(r\)-matchings in a tree
- Number of pairs of template matchings in \(q\)-ary tree with randomly marked vertices
- Counting the maximal and perfect matchings in benzenoid chains
- Global forcing number for maximal matchings
Recommendations
This page was built for publication: On the number of matchings of a tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q875067)