scientific article; zbMATH DE number 857606

MaRDI QIDQ4870352zbMATH OpenFDO

Authors Hongen Liu, Jinjiang Yuan

Publication date 18 March 1996

zbMATH Keywords

cutwidthgraph productgrid graphslabeling

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• A degree sequence method for the cutwidth problem of graphs
• scientific article; zbMATH DE number 90113
• Cyclic cutwidths of the two-dimensional ordinary and cylindrical meshes
• Cutwidth of split graphs and threshold graphs
• On 3-cutwidth critical graphs

Cited in

(9)

• On spanning tree congestion of graphs
• Maximum cutwidth problem for graphs.
• On 3-cutwidth critical graphs
• The cutwidth of trees with diameters at most 4
• Characterizations of \(k\)-cutwidth critical trees
• Cutwidth of triangular grids
• scientific article; zbMATH DE number 1490011 (Why is no real title available?)
• A degree sequence method for the cutwidth problem of graphs
• Edge-maximal graphs with cutwidth at most three

This page was built for publication:

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