Pages that link to "Item:Q1108810"
From MaRDI portal
The following pages link to A polynomial characterization of some graph partitioning problems (Q1108810):
Displaying 13 items.
- \textsc{max-cut} and containment relations in graphs (Q441861) (← links)
- A P-complete graph partition problem (Q917313) (← links)
- 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)
- A solution to Gutman's problem on the characteristic polynomial of a bipartite graph (Q1918564) (← links)
- On uniform \(k\)-partition problems (Q2565854) (← links)
- The equipartition polytope. I: Formulations, dimension and basic facets (Q2639779) (← links)
- SIMPLE MAX-CUT for unit interval graphs and graphs with few \(P4\)s (Q2741323) (← links)
- Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps (Q2953793) (← links)
- max-cut and Containment Relations in Graphs (Q3057609) (← links)
- Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs (Q5886117) (← links)
- On three polynomial kernels of sequences for arbitrarily partitionable graphs (Q5962512) (← links)
