• A note on the subgraphs of the (2×\infty)-grid 

    Díaz Cort, Josep; Kaminski, Marcin; Thilikos Touloupas, Dimitrios (2010-02)
    Accés restringit per política de l'editorial
    We give a linear-time algorithm checking whether a graph is a subgraph of the (2×k)-grid for some value of k. Our algorithm is based on a detailed characterization of the structure of such graphs.