Pages that link to "Item:Q2476243"
From MaRDI portal
The following pages link to Lower bounds on the pathwidth of some grid-like graphs (Q2476243):
Displaying 14 items.
- Fast searching games on graphs (Q411259) (← links)
- Enumerating Hamiltonian cycles (Q463046) (← links)
- Bandwidth and pathwidth of three-dimensional grids (Q534058) (← links)
- A cops and robber game in multidimensional grids (Q602750) (← links)
- On the stab number of rectangle intersection graphs (Q778517) (← links)
- On the treewidth of toroidal grids (Q897618) (← links)
- Security number of grid-like graphs (Q967295) (← links)
- Standard directed search strategies and their applications (Q1029267) (← links)
- Searching for an intruder on graphs and their subdivisions (Q2153405) (← links)
- Many-to-many two-disjoint path covers in cylindrical and toroidal grids (Q2341724) (← links)
- On oblivious branching programs with bounded repetition that cannot efficiently compute CNFs of bounded treewidth (Q2408558) (← links)
- Tight Bounds for Linkages in Planar Graphs (Q3012796) (← links)
- Bounding the search number of graph products (Q5215862) (← links)
- On-line search in two-dimensional environment (Q5919296) (← links)