The complexity of cubical graphs (Q3736911)

From MaRDI portal
Revision as of 16:17, 18 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The complexity of cubical graphs
scientific article

    Statements

    title
    The complexity of cubical graphs (English)
    0 references
    author
    Foto N. Afrati
    0 references
    Q197784
    0 references
    George Papageorgiou
    0 references
    publication date
    1985
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    68Q25
    0 references
    05C10
    0 references
    05C15
    0 references
    zbMATH DE Number
    3970115
    0 references
    zbMATH Keywords
    subgraph of a hypercube
    0 references
    edge coloring
    0 references
    dimension
    0 references
    NP-complete
    0 references
    embedding
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3736911&oldid=8166076"
      Powered by MediaWiki