On 3-cutwidth critical graphs
type: Item
instance of: scholarly article
title: On 3-cutwidth critical graphs
zbMATH Open document ID: 1030.05100
author: Yanpei Liu
author: Aifeng Yang
published in: Discrete Mathematics
publication date: 2004-02-02T00:00:00Z
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05C78
zbMATH DE Number: 2035884
zbMATH Keywords: Graph labeling
zbMATH Keywords: Cutwidth
zbMATH Keywords: Critical graph
MaRDI profile type: Publication
full work available at URL: j.disc.2003.06.012
OpenAlex ID: W1985760010
cites work: Forbidden minors characterization of partial 3-trees
cites work: Q3803160
cites work: Graphs with small bandwidth and cutwidth
cites work: Q4198056
cites work: Tree-width, path-width, and cutwidth
cites work: The cutwidth of trees with diameters at most 4
cites work: A degree sequence method for the cutwidth problem of graphs
cites work: Q4870352
cites work: A characterization of partial 3-trees
cites work: A polynomial algorithm for the min-cut linear arrangement of trees
DOI: 10.1016/J.DISC.2003.06.012
description: scientific article; zbMATH DE number 2035884