Bandwidth of trees of diameter at most 4

DOI10.1016/j.disc.2012.03.006zbMath1244.05054OpenAlexW2074580307MaRDI QIDQ427848

Rodrigo Farnham, Guoli Ding, Stan Dziobiak, Lisa Warshauer Lowrance, Mark Bilinski, Shirley Leu, Perry Iverson, Deborah Chun, Kwang Ju Choi

Publication date: 18 June 2012

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

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

zbMATH Keywords

treebandwidthpolynomial time algorithm

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
• The bandwidth problem for graphs and matrices—a survey
• The Bandwidth Problem: critical Subgraphs and the Solution for Caterpillars
• The Bandwidth of Caterpillars with Hairs of Length 1 and 2
• Complexity Results for Bandwidth Minimization
• A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs

This page was built for publication: Bandwidth of trees of diameter at most 4