A note on the subgraphs of the (2 )-grid

DOI10.1016/J.DISC.2009.03.046MaRDI QIDQ960965zbMATH OpenOpenAlexFDO

Authors Dimitrios M. Thilikos, J. Díaz, Marcin Kamiński

Publication date 29 March 2010

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2009.03.046

zbMATH Keywords

biconnected componentslinear-time algorithmpartial grids

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• A linear-time algorithm for drawing a planar graph on an (n-2) (n-2) grid.
• A linear-time algorithm for drawing a planar graph on a grid
• scientific article; zbMATH DE number 2094524
• scientific article; zbMATH DE number 2105044
• scientific article; zbMATH DE number 4072379

Cites work

• A CHARACTERIZATION OF k-TH POWERS P_n,k OF PATHS IN TERMS OF k-TREES
• Complexity Results for Bandwidth Minimization
• scientific article; zbMATH DE number 1151379 (Why is no real title available?)
• Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem
• On bandwidth-2 graphs
• On the complexity of finding iso- and other morphisms for partial \(k\)- trees

Cited in

(3)

• scientific article; zbMATH DE number 2105044 (Why is no real title available?)
• scientific article; zbMATH DE number 2226729 (Why is no real title available?)
• Some families of alpha-labeled subgraphs of the integral grid

This page was built for publication: A note on the subgraphs of the (\(2\times \infty \))-grid

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q960965)