Hypergraph planarity and the complexity of drawing venn diagrams (Q3800081): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56171393, #quickstatements; #temporary_batch_1712190744730
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1002/jgt.3190110306 / rank
Normal rank
 
Property / cites work
 
Property / cites work: On the Desirability of Acyclic Database Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Planarity Testing / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/jgt/JohnsonP87 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1002/JGT.3190110306 / rank
 
Normal rank

Latest revision as of 19:50, 21 December 2024

scientific article
Language Label Description Also known as
English
Hypergraph planarity and the complexity of drawing venn diagrams
scientific article

    Statements

    Hypergraph planarity and the complexity of drawing venn diagrams (English)
    0 references
    0 references
    0 references
    1987
    0 references
    vertex-planar hypergraph
    0 references
    hyperedge-planar hypergraph
    0 references

    Identifiers