Maximum cutwidth problem for graphs.

DOI10.1007/S11766-003-0030-5MaRDI QIDQ1413710zbMATH OpenOpenAlexFDO

Authors Jianxiu Hao

Publication date 17 November 2003

Published in Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11766-003-0030-5

zbMATH Keywords

extremal graphcutwidth

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Publication:4870352
• 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

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 857606 (Why is no real title available?)
• Graph theory with applications
• Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees

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)