scientific article; zbMATH DE number 857606

zbMATH Open0839.05082MaRDI QIDQ4870352FDOQ4870352

Authors: Hongen Liu, Jinjiang Yuan 

Publication date: 18 March 1996

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

labelinggrid graphscutwidthgraph product

Mathematics Subject Classification ID

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

Cited In (7)

• 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
• 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)