An upper bound of the bandwidth of a graph in terms of the treewidth

MaRDI QIDQ2715212zbMATH OpenFDO

Authors Jinjiang Yuan, Shiying Wang

Publication date 20 June 2001

Published in Journal of Xinjiang University. Natural Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

This page was built for publication: An upper bound of the bandwidth of a graph in terms of the treewidth

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