Decompositions of critical trees with cutwidth \(k\)

DOI10.1007/s40314-019-0924-3zbMath1438.05222OpenAlexW2977426240WikidataQ127194118 ScholiaQ127194118MaRDI QIDQ2326339

Zhen-Kun Zhang

Publication date: 7 October 2019

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40314-019-0924-3

zbMATH Keywords

decompositiongraph labelingcutwidthcritical tree

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Decomposability of a class of \(k\)-cutwidth critical graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On 3-cutwidth critical graphs
• Tree-width, path-width, and cutwidth
• Characterizations of \(k\)-cutwidth critical trees
• 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
• Cutwidth II: Algorithms for partial w-trees of bounded degree

This page was built for publication: Decompositions of critical trees with cutwidth \(k\)