Computational complexity of covering multigraphs with semi-edges: small cases (Q6885370)

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 8135746
Language Label Description Also known as
default for all languages
No label defined
    English
    Computational complexity of covering multigraphs with semi-edges: small cases
    scientific article; zbMATH DE number 8135746

      Statements

      Computational complexity of covering multigraphs with semi-edges: small cases (English)
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      11 December 2025
      0 references
      graph cover
      0 references
      covering projection
      0 references
      semi-edges
      0 references
      multigraphs
      0 references
      computational complexity
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references