Maximum cutwidth problem for graphs.
From MaRDI portal
The paper establishes bounds on the size of a connected graph of given order and cutwidth. Certain extremal configurations are exhibited.
Recommendations
- scientific article; zbMATH DE number 857606
- Max-cut under graph constraints
- Max-cut in circulant graphs
- scientific article; zbMATH DE number 1496855
- scientific article; zbMATH DE number 1854105
- Max-Cut and containment relations in graphs
- Complexity of maximum cut on interval graphs
- The maximum cut problem
Cites work
This page was built for publication: Maximum cutwidth problem for graphs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1413710)