Maximum cutwidth problem for graphs.

DOI10.1007/S11766-003-0030-5zbMath1035.05079OpenAlexW2086403669MaRDI QIDQ1413710

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)

Cites Work

• Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Maximum cutwidth problem for graphs.