The Complexity of A Planar Hypermap And That of Its Dual (Q3918150)

From MaRDI portal
Revision as of 14:23, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The Complexity of A Planar Hypermap And That of Its Dual
scientific article

    Statements

    The Complexity of A Planar Hypermap And That of Its Dual (English)
    0 references
    0 references
    0 references
    1980
    0 references
    0 references
    characteristic of a hypermap
    0 references
    underlying hypergraph
    0 references