An upper bound of the bandwidth of a graph in terms of the treewidth (Q2715212)

From MaRDI portal
!
WARNING

This is the item page for this Wikibase entity, intended for internal use and editing purposes.

scientific article; zbMATH DE number 1607696
Language Label Description Also known as
default for all languages
No label defined
    English
    An upper bound of the bandwidth of a graph in terms of the treewidth
    scientific article; zbMATH DE number 1607696

      Statements

      0 references
      0 references
      20 June 2001
      0 references
      An upper bound of the bandwidth of a graph in terms of the treewidth (English)
      0 references

      Identifiers