An extremal graph with given bandwidth

DOI10.1016/J.TCS.2007.03.012zbMath1117.05058OpenAlexW2001966978MaRDI QIDQ884479

Chang-Sin Tian, Yung-Ling Lai

Publication date: 6 June 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.03.012

zbMATH Keywords

bandwidthextremal graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (2)

New classes of extremal graphs with given bandwidth ⋮ Multilevel Bandwidth and Radio Labelings of Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the size of graphs of a given bandwidth
• The NP-completeness of the bandwidth minimization problem
• The bandwidth problem for graphs and matrices—a survey
• 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: An extremal graph with given bandwidth