Forests and score vectors

DOI10.1007/BF02579176zbMath0491.05028MaRDI QIDQ1167181

Kenneth J. Winston, Daniel J. Kleitman

Publication date: 1981

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

labeled digraphout-degreesset of subgraphs

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20)

Related Items (7)

Counting tournament score sequences ⋮ Classification of external zonotopal algebras ⋮ Convex polytopes and enumeration ⋮ On \(Q\)-deformations of Postnikov-Shapiro algebras ⋮ On the number of forests and connected spanning subgraphs ⋮ The polytope of win vectors ⋮ On the asymptotic number of tournament score sequences

Cites Work

• Depth-first search as a combinatorial correspondence
• Algorithms for constructing graphs and digraphs with given valences and factors
• Decompositions of Rational Convex Polytopes
• Unnamed Item

This page was built for publication: Forests and score vectors