Intersection graphs of paths in a tree
Journal of Combinatorial Theory Series B
Theory of linear and integer programming
Theory of linear and integer programming
On k-optimum dipath partitions and partial k-colourings of acyclic diagraphs
European Journal of Combinatorics
Discrete Mathematics - Special volume (part two) to mark the centennial of Julius Petersen's “Die theorie der regula¨ren graphs” (“The theory of regular graphs”)
On Greene-Kleitman's theorem for general digraphs
Discrete Mathematics
Orthogonal structures in directed graphs
Journal of Combinatorial Theory Series B
Polyhedral and algorithmic ramifications of antichains
Polyhedral and algorithmic ramifications of antichains
Minmax relations for cyclically ordered digraphs
Journal of Combinatorial Theory Series B
Proof of Berge's strong path partition conjecture for k=2
European Journal of Combinatorics
The k-edge intersection graphs of paths in a tree
Discrete Applied Mathematics
Finding coherent cyclic orders in strong digraphs
Combinatorica
Cyclic orders: Equivalence and duality
Combinatorica
Polyhedra with the Integer Carathéodory Property
Journal of Combinatorial Theory Series B
| Hi-index | 0.01 |
A polyhedron P has the integer decomposition property , if every integer vector in kP is the sum of k integer vectors in P . We explain that the projections of polyhedra defined by totally unimodular constraint matrices have the integer decomposition property, in order to deduce the same property for coflow polyhedra defined by Cameron and Edmonds. We then apply this result to the convex hull of particular stable sets in graphs. Therebye we prove a generalization of Greene and Kleitman's well-known theorem on posets to arbitrary digraphs which implies recent and classical purely graph theoretical results on cycle covers, is closely related to conjectures of Berge and Linial on path partitions, and implies these for some particular values of the parameters.