Decomposability of a class of k-cutwidth critical graphs

DOI10.1007/S10878-021-00782-6MaRDI QIDQ2125221zbMATH OpenOpenAlexFDO

Authors Zhenkun Zhang, Zhong Zhao, Liuyong Pang

Publication date 13 April 2022

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-021-00782-6

zbMATH Keywords

critical graphcutwidthdecomposabilitygraph labeling

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Combinatorial optimization (90C27)

Recommendations

• Decompositions of critical trees with cutwidth k
• On 3-cutwidth critical graphs
• Characterizations of \(k\)-cutwidth critical trees
• On 4-cutwidth critical trees.
• A degree sequence method for the cutwidth problem of graphs

Cites work

• A polynomial algorithm for the min-cut linear arrangement of trees
• Characterizations of \(k\)-cutwidth critical trees
• Cutwidth II: Algorithms for partial w-trees of bounded degree
• Cutwidth of iterated caterpillars
• Cutwidth of the r-dimensional mesh of d-ary trees
• Decompositions of critical trees with cutwidth k
• Graph theory
• scientific article; zbMATH DE number 4070955 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• On 3-cutwidth critical graphs
• On 4-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
• Topological Bandwidth
• Tree-width, path-width, and cutwidth

Cited in

(5)

• On 3-cutwidth critical graphs
• Decompositions of critical trees with cutwidth k
• Characterizations of \(k\)-cutwidth critical trees
• scientific article; zbMATH DE number 4075124 (Why is no real title available?)
• On 4-cutwidth critical trees.

This page was built for publication: Decomposability of a class of \(k\)-cutwidth critical graphs

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