The Polytope of Dual Degree Partitions
classification
🧮 math.CO
keywords
degreedualpartitionsconvexdetermineextremefacetsgraphs
read the original abstract
We determine the extreme points and facets of the convex hull of all dual degree partitions of simple graphs on $n$ vertices.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.