New classes of extremal graphs with given bandwidth

DOI10.1007/S00373-013-1386-9zbMATH Open1306.05107OpenAlexW2066294895MaRDI QIDQ489353FDOQ489353

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

Recommendations

• An extremal graph with given bandwidth
• An extremal bandwidth problem for bipartite graphs
• scientific article; zbMATH DE number 1161305
• scientific article; zbMATH DE number 3859182
• Some new results in extremal graph theory
• Bounding the bandwidths for graphs
• On extremal graphs with bounded girth
• New graph classes of bounded clique-width
• scientific article; zbMATH DE number 1953082
• scientific article

zbMATH Keywords

bandwidthextremal graphminimum size

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
• On the number of edges of quadrilateral-free graphs
• The bandwidth problem for graphs and matrices—a survey
• On the size of graphs of a given bandwidth
• Graphs without four-cycles
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An extremal graph with given bandwidth

Cited In (2)

• An extremal bandwidth problem for bipartite graphs
• An extremal graph with given bandwidth

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

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