Deciding whether a grid is a topological subgraph of a planar graph is NP-complete (Q5918671)

From MaRDI portal
scientific article; zbMATH DE number 7515210
Language Label Description Also known as
English
Deciding whether a grid is a topological subgraph of a planar graph is NP-complete
scientific article; zbMATH DE number 7515210

    Statements

    Deciding whether a grid is a topological subgraph of a planar graph is NP-complete (English)
    0 references
    0 references
    0 references
    27 April 2022
    0 references
    0 references
    topological subgraph
    0 references
    subgraph homeomorphism
    0 references
    subdivision
    0 references
    grids
    0 references
    planar graph
    0 references
    NP-complete
    0 references
    0 references
    0 references