The cutwidth of trees with diameters at most 4

DOI10.1007/s11766-003-0062-xzbMath1040.05025OpenAlexW2030458214MaRDI QIDQ1430969

Yanpei Liu

Publication date: 27 May 2004

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-0062-x

zbMATH Keywords

bandwidthgraph labeling

Mathematics Subject Classification ID

Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (2)

Characterizations of \(k\)-cutwidth critical trees ⋮ On 3-cutwidth critical graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A degree sequence method for the cutwidth problem of graphs
• On minimizing width in linear layouts
• Graphs with small bandwidth and cutwidth
• Fill-in and operations of graphs
• On the Cutwidth and the Topological Bandwidth of a Tree
• Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees
• A polynomial algorithm for the min-cut linear arrangement of trees
• Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees

This page was built for publication: The cutwidth of trees with diameters at most 4