An extremal bandwidth problem for bipartite graphs

DOI10.1002/1097-0118(200012)35:4%3C278::AID-JGT5%3E3.0.CO;2-UMaRDI QIDQ4521497zbMATH OpenOpenAlexFDO

Authors Robert Brigham, Julie R. Carrington, Joseph Fiedler, Richard P. Vitray, Ronald D. Dutton

Publication date 10 May 2001

Full work available at URL https://doi.org/10.1002/1097-0118(200012)35:4%3C278::aid-jgt5%3E3.0.co;2-u

zbMATH Keywords

bandwidthbipartite graphsextremal graph theory

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1161305
• An extremal graph with given bandwidth
• scientific article; zbMATH DE number 1778090
• scientific article; zbMATH DE number 1895637
• New classes of extremal graphs with given bandwidth

Cites work

• On the size of graphs of a given bandwidth
• The bandwidth problem for graphs and matrices—a survey

Cited in

(5)

• Bandwidth of bipartite permutation graphs in polynomial time
• scientific article; zbMATH DE number 11990 (Why is no real title available?)
• scientific article; zbMATH DE number 1161305 (Why is no real title available?)
• scientific article; zbMATH DE number 1778090 (Why is no real title available?)
• New classes of extremal graphs with given bandwidth

This page was built for publication: An extremal bandwidth problem for bipartite graphs

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