No label defined (Q4660720)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 2151250
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 2151250

      Statements

      0 references
      0 references
      0 references
      4 April 2005
      0 references
      \(H\)-coloring
      0 references
      parameterized complexity
      0 references
      FPT
      0 references
      counting
      0 references
      bounded treewidth
      0 references
      This survey paper summarises results on the complexity of various versions of the (list) \(H\)-colouring problem, where the fixed parameter is the treewidth of the input graph, or the sizes of the preimages of certain vertices of \(H\). For the entire collection see [Zbl 1051.05003].
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references