pith. sign in

arxiv: math/0612061 · v1 · submitted 2006-12-02 · 🧮 math.CO

The Polytope of Dual Degree Partitions

classification 🧮 math.CO
keywords degreedualpartitionsconvexdetermineextremefacetsgraphs
0
0 comments X
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.