List H-coloring a graph by removing few vertices (Q6826784)

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 6714286
Language Label Description Also known as
default for all languages
No label defined
    English
    List H-coloring a graph by removing few vertices
    scientific article; zbMATH DE number 6714286

      Statements

      List H-coloring a graph by removing few vertices (English)
      0 references
      0 references
      0 references
      0 references
      0 references
      11 May 2017
      0 references
      fixed-parameter tractability
      0 references
      graph homomorphism
      0 references
      treewidth reduction
      0 references
      iterative compression
      0 references
      shadow removal
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references