A degree sequence method for the cutwidth problem of graphs

DOI10.1007/S11766-002-0036-4zbMATH Open1004.05052OpenAlexW2012106025MaRDI QIDQ698370FDOQ698370

Authors: Xianglu Li, Aifeng Yang, 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

Recommendations

• scientific article; zbMATH DE number 1854105
• On 3-cutwidth critical graphs
• On 4-cutwidth critical trees.
• scientific article; zbMATH DE number 1875430
• Characterizations of \(k\)-cutwidth critical trees

zbMATH Keywords

labelingbandwidth

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A polynomial algorithm for the min-cut linear arrangement of trees
• The bandwidth problem for graphs and matrices—a survey
• Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Cutwidth and the Topological Bandwidth of a Tree

Cited In (9)

• Cutwidth of triangular grids
• Characterizations of \(k\)-cutwidth critical trees
• The cutwidth of trees with diameters at most 4
• Decomposability of a class of \(k\)-cutwidth critical graphs
• Multiplicity of finite graphs over the real line
• On 3-cutwidth critical graphs
• Title not available (Why is that?)
• Cutwidth of iterated caterpillars
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q698370)