An upper bound of the bandwidth of a graph in terms of the treewidth
From MaRDI portal
Publication:2715212
zbMATH Open0964.05546MaRDI QIDQ2715212FDOQ2715212
Publication date: 20 June 2001
Published in: Journal of Xinjiang University. Natural Science (Search for Journal in Brave)
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)
