The cone of balanced subgraphs

DOI10.1016/j.laa.2009.02.029zbMath1169.05372OpenAlexW2081233737MaRDI QIDQ1019652

Uri N. Peled, Amitava Bhattacharya, Murali K. Srinivasan

Publication date: 4 June 2009

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2009.02.029

zbMATH Keywords

fractional sumcolored graphscycle conealternating walks and trailsbalanced subgraphsbalanced sumTutte set

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

A survey of discrete methods in (algebraic) statistics for networks

Cites Work

• Cones of closed alternating walks and trails
• Alternating cycles in edge-partitioned graphs
• A note on alternating cycles in edge-coloured graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The cone of balanced subgraphs