Complexity and algorithms for recognizing polar and monopolar graphs (Q2437850)

From MaRDI portal
Revision as of 11:53, 7 July 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
Complexity and algorithms for recognizing polar and monopolar graphs
scientific article

    Statements

    Complexity and algorithms for recognizing polar and monopolar graphs (English)
    0 references
    0 references
    0 references
    13 March 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    polar graph
    0 references
    monopolar graph
    0 references
    planar graph
    0 references
    computational complexity
    0 references
    0 references