Bandwidth edge counts for linear arrangements of rectangular grids

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199712)26:4<195::AID-JGT3>3.0.CO;2-L" /><195::AID-JGT3>3.0.CO;2-L 10.1002/(SICI)1097-0118(199712)26:4<195::AID-JGT3>3.0.CO;2-LzbMath0888.05049OpenAlexW4239751875MaRDI QIDQ4376494

Paul E. Wright, Peter C. Fishburn

Publication date: 11 February 1998

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199712)26:4<195::aid-jgt3>3.0.co;2-l

zbMATH Keywords

bandwidthrectangular gridslinear arrangement

Mathematics Subject Classification ID

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

Related Items (1)

Bounds on mincut for Cayley graphs over Abelian groups

This page was built for publication: Bandwidth edge counts for linear arrangements of rectangular grids