An extremal bandwidth problem for bipartite graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/1097-0118(200012)35:4<278::AID-JGT5>3.0.CO;2-U" /><278::AID-JGT5>3.0.CO;2-U 10.1002/1097-0118(200012)35:4<278::AID-JGT5>3.0.CO;2-UzbMath0960.05087OpenAlexW4249599363MaRDI QIDQ4521497

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

Publication date: 10 May 2001

Full work available at URL: https://doi.org/10.1002/1097-0118(200012)35:4<278::aid-jgt5>3.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)

Cites Work

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

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