1 citations · 1 across the 4 of their papers we have counts for
Showing 2006 · math.COShow all
2 papers · 2 filters
math.CO2006
The Polytope of Dual Degree Partitions
Amitava Bhattacharya, Shmuel Friedland, Uri N. Peled
We determine the extreme points and facets of the convex hull of all dual degree partitions of simple graphs on vertices.
math.CO2006★ 1 cited
Chain Graphs have Unbounded Readability
Martin Charles Golumbic, Uri N. Peled, Udi Rotics
A triangle-free graph is called read- when there exists a monotone Boolean formula whose variables are the vertices of and whose minterms are precisely the edges of…