Recognizing hole-free 4-map graphs in cubic time (Q2498931)

From MaRDI portal
Revision as of 08:52, 5 August 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
Recognizing hole-free 4-map graphs in cubic time
scientific article

    Statements

    Recognizing hole-free 4-map graphs in cubic time (English)
    0 references
    0 references
    0 references
    0 references
    11 August 2006
    0 references
    planar graphs
    0 references
    maps
    0 references
    map graphs
    0 references
    cliques
    0 references
    graph algorithms
    0 references

    Identifiers