scientific article; zbMATH DE number 857606

MaRDI QIDQ4870352zbMATH OpenFDO

Authors Hongen Liu, Jinjiang Yuan

Publication date 18 March 1996

zbMATH Keywords

labelinggrid graphscutwidthgraph product

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

(8)

• Cutwidth of triangular grids
• Characterizations of \(k\)-cutwidth critical trees
• A degree sequence method for the cutwidth problem of graphs
• On spanning tree congestion of graphs
• Edge-maximal graphs with cutwidth at most three
• Maximum cutwidth problem for graphs.
• The cutwidth of trees with diameters at most 4
• On 3-cutwidth critical graphs

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)