The Graph Partitioning Polytope on Series-Parallel and 4-Wheel Free Graphs

DOI10.1137/S0895480191199415zbMath0797.05073MaRDI QIDQ4287936

Sunil Chopra

Publication date: 12 May 1994

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

4-wheel free graphgraph partitioning polytope

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Graph theory (05C99)

Related Items

Arborescence polytopes for series-parallel graphs, An overview of graph covering and partitioning, Cardinality constrained Boolean quadratic polytope, Trader multiflow and box-TDI systems in series-parallel graphs, Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations, A polyhedral study of lifted multicuts, Circuit and bond polytopes on series-parallel graphs, Improved compact formulations for a wide class of graph partitioning problems in sparse graphs, Projection results for the \(k\)-partition problem, Max-multiflow/min-multicut for G+H series-parallel, Cliques and clustering: A combinatorial approach, Min-cut clustering