Pages that link to "Item:Q1108810"
From MaRDI portal
The following pages link to A polynomial characterization of some graph partitioning problems (Q1108810):
Displayed 5 items.
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- Maximum cut on line and total graphs (Q1304481) (← links)
- Some new classes of facets for the equicut polytope (Q1900144) (← links)
- The equipartition polytope. I: Formulations, dimension and basic facets (Q2639779) (← links)
- (Q2741323) (← links)