Cutwidth of iterated caterpillars

DOI10.1051/ITA/2012032MaRDI QIDQ4928767zbMATH OpenOpenAlexFDO

Authors Lan Lin, Yanpei Liu

Publication date 18 June 2013

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL http://www.numdam.org/item?id=ITA_2013__47_2_181_0/

zbMATH Keywords

caterpillarcircuit layout designcutwidthgraph labelingiterated caterpillar

Mathematics Subject Classification ID

Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A degree sequence method for the cutwidth problem of graphs
• The cyclic cutwidth of trees
• On 4-cutwidth critical trees.
• The cutwidth of trees with diameters at most 4
• On 3-cutwidth critical graphs

Cited in

(3)

• Decomposability of a class of \(k\)-cutwidth critical graphs
• Cutwidth of triangular grids
• Edge-maximal graphs with cutwidth at most three

This page was built for publication: Cutwidth of iterated caterpillars

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