Complexity of graph embeddability problems (Q1152224)

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 3720365
Language Label Description Also known as
default for all languages
No label defined
    English
    Complexity of graph embeddability problems
    scientific article; zbMATH DE number 3720365

      Statements

      Complexity of graph embeddability problems (English)
      0 references
      0 references
      1981
      0 references
      time complexity
      0 references
      combinatorial embeddability in infinite graphs
      0 references
      planar graph
      0 references

      Identifiers