New classes of extremal graphs with given bandwidth

DOI10.1007/s00373-013-1386-9zbMath1306.05107OpenAlexW2066294895MaRDI QIDQ489353

Lan Lin, Yanpei Liu

Publication date: 20 January 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-013-1386-9

zbMATH Keywords

bandwidthextremal graphminimum size

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Cites Work

• An extremal graph with given bandwidth
• On the size of graphs of a given bandwidth
• On the number of edges of quadrilateral-free graphs
• Graphs without four-cycles
• The bandwidth problem for graphs and matrices—a survey
• A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New classes of extremal graphs with given bandwidth