par Díaz, Josep;Kaminski, Marcin ;Thilikos Touloupas, Dimitrios
Référence Discrete mathematics, 310, 3, page (531-536)
Publication Publié, 2010-02
Article révisé par les pairs
Résumé : 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. © 2009 Elsevier B.V. All rights reserved.