A degree sequence method for the cutwidth problem of graphs

DOI10.1007/S11766-002-0036-4zbMath1004.05052OpenAlexW2012106025MaRDI QIDQ698370

Aifeng Yang, Xianglu Li, Yanpei Liu

Publication date: 6 February 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-002-0036-4

zbMATH Keywords

labelingbandwidth

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (5)

Characterizations of \(k\)-cutwidth critical trees ⋮ Cutwidth of triangular grids ⋮ On 3-cutwidth critical graphs ⋮ The cutwidth of trees with diameters at most 4 ⋮ Multiplicity of finite graphs over the real line

Cites Work

• 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
• The bandwidth problem for graphs and matrices—a survey
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A degree sequence method for the cutwidth problem of graphs