Cutwidth of triangular grids

DOI10.1016/J.DISC.2014.04.029zbMATH Open1297.05206OpenAlexW2163300341MaRDI QIDQ397153FDOQ397153

Lan Lin, Yixun Lin, Douglas B. West

Publication date: 8 August 2014

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

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

zbMATH Keywords

bandwidthgraph labelingcutwidthtriangular grid

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimal numberings and isoperimetric problems on graphs
• Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem
• The congestion of \(n\)-cube layout on a rectangular grid
• Optimal labelling of a product of two paths
• A polynomial algorithm for the min-cut linear arrangement of trees
• The bandwidth problem for graphs and matrices—a survey
• On the bandwidth of triangulated triangles
• Cutwidth of the \(r\)-dimensional mesh of \(d\)-ary trees
• Cutwidth of iterated caterpillars
• A polynomial algorithm for recognizing bounded cutwidth in hypergraphs
• A degree sequence method for the cutwidth problem of graphs

Cited In (5)

• Edge-bandwidth of the triangular grid
• The minimum stretch spanning tree problem for typical graphs
• Hole-Cutting for Three-Dimensional Overlapping Grids
• New bounds on the edge-bandwidth of triangular grids
• On the relative strength of split, triangle and quadrilateral cuts

This page was built for publication: Cutwidth of triangular grids

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