Hypergraph planarity and the complexity of drawing venn diagrams (Q3800081)

From MaRDI portal
Revision as of 18:50, 18 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Hypergraph planarity and the complexity of drawing venn diagrams
scientific article

    Statements

    title
    Hypergraph planarity and the complexity of drawing venn diagrams (English)
    0 references
    author
    H. O. Pollak
    0 references
    David S. Johnson
    0 references
    publication date
    1987
    0 references
    zbMATH Keywords
    vertex-planar hypergraph
    0 references
    hyperedge-planar hypergraph
    0 references

    Identifiers

    zbMATH DE Number
    4066946
    0 references
    OpenAlex ID
    W2153718046
    0 references
    Wikidata QID
    Q56171393
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3800081&oldid=34791605"
    Powered by MediaWiki