Alternating Whitney sums and matchings in trees. 1
From MaRDI portal
Publication:1105614
DOI10.1016/0012-365X(87)90026-4zbMath0649.05027OpenAlexW4210347021MaRDI QIDQ1105614
Publication date: 1987
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(87)90026-4
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (8)
Factors of trees ⋮ Random subtrees and unimodal sequences in graphs ⋮ The ratio of the numbers of odd and even cycles in outerplanar graphs ⋮ On the roots of the subtree polynomial ⋮ When bad things happen to good trees ⋮ Constant tolerance intersection graphs of subtrees of a tree ⋮ Alternating Whitney sums and matchings in trees. II ⋮ Neighborhoods of trees in circular orderings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Monotonicity of the mean order of subtrees
- The theory of convex geometries
- Meet-distributive lattices and the anti-exchange closure
- Maximum matchings and trees
- On the average number of nodes in a subtree of a tree
- Listing and Counting Subtrees of a Tree
- Paths, Trees, and Flowers
This page was built for publication: Alternating Whitney sums and matchings in trees. 1
