A note on the subgraphs of the (\(2\times \infty \))-grid
From MaRDI portal
Publication:960965
DOI10.1016/J.DISC.2009.03.046zbMath1216.05157OpenAlexW2043866946MaRDI QIDQ960965
Dimitrios M. Thilikos, Josep Diaz, Marcin Kaminski
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
Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- On the complexity of finding iso- and other morphisms for partial \(k\)- trees
- On bandwidth-2 graphs
- Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem
- Complexity Results for Bandwidth Minimization
- A CHARACTERIZATION OF k-TH POWERS Pn,k OF PATHS IN TERMS OF k-TREES
This page was built for publication: A note on the subgraphs of the (\(2\times \infty \))-grid