On 3-cutwidth critical graphs

DOI10.1016/j.disc.2003.06.012zbMath1030.05100OpenAlexW1985760010MaRDI QIDQ1420615

Aifeng Yang, Yanpei Liu

Publication date: 2 February 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2003.06.012

zbMATH Keywords

Critical graphCutwidthGraph labeling

Mathematics Subject Classification ID

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

Related Items (4)

Decomposability of a class of \(k\)-cutwidth critical graphs ⋮ Characterizations of \(k\)-cutwidth critical trees ⋮ Invariants of graph drawings in the plane ⋮ Decompositions of critical trees with cutwidth \(k\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A degree sequence method for the cutwidth problem of graphs
• Forbidden minors characterization of partial 3-trees
• Graphs with small bandwidth and cutwidth
• The cutwidth of trees with diameters at most 4
• Tree-width, path-width, and cutwidth
• A characterization of partial 3-trees
• A polynomial algorithm for the min-cut linear arrangement of trees

This page was built for publication: On 3-cutwidth critical graphs