A degree sequence method for the cutwidth problem of graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4070955 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 568819 (Why is no real title available?)
- scientific article; zbMATH DE number 857606 (Why is no real title available?)
- A polynomial algorithm for the min-cut linear arrangement of trees
- On the Cutwidth and the Topological Bandwidth of a Tree
- Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees
- The bandwidth problem for graphs and matrices—a survey
Cited in
(9)- Decomposability of a class of \(k\)-cutwidth critical graphs
- scientific article; zbMATH DE number 1854105 (Why is no real title available?)
- Cutwidth of triangular grids
- Cutwidth of iterated caterpillars
- On 3-cutwidth critical graphs
- Multiplicity of finite graphs over the real line
- Characterizations of \(k\)-cutwidth critical trees
- The cutwidth of trees with diameters at most 4
- scientific article; zbMATH DE number 857606 (Why is no real title available?)
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)
