Alternating Whitney sums and matchings in trees. II

DOI10.1016/0012-365X(90)90032-DzbMath0717.05030MaRDI QIDQ753825

Robert E. Jamison

Publication date: 1990

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

zbMATH Keywords

maximum independent setsmaximum matchingWhitney number

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (5)

The ratio of the numbers of odd and even cycles in outerplanar graphs ⋮ On the roots of the subtree polynomial ⋮ Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees ⋮ When bad things happen to good trees ⋮ Constant tolerance intersection graphs of subtrees of a tree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Alternating Whitney sums and matchings in trees. 1
• A graph polynomial and its applications
• Paths, Trees, and Flowers

This page was built for publication: Alternating Whitney sums and matchings in trees. II