Four-searchable biconnected outerplanar graphs
From MaRDI portal
Publication:2243137
DOI10.1016/j.dam.2021.09.011zbMath1477.05176MaRDI QIDQ2243137
Danny Dyer, Öznur Yaşar Diner, Boting Yang
Publication date: 11 November 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2021.09.011
68R10: Graph theory (including graph drawing) in computer science
05C10: Planar graphs; geometric and topological aspects of graph theory
05C83: Graph minors
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph minors. XX: Wagner's conjecture
- An annotated bibliography on guaranteed graph searching
- The vertex separation and search number of a graph
- Obstruction set isolation for the gate matrix layout problem
- Graph minors. XVI: Excluding a non-planar graph
- Algorithms and obstructions for linear-width and related search parameters
- Graph searching, elimination trees, and a generalization of bandwidth
- Forbidden minors and subdivisions for toroidal graphs with no K3,3's
- On the Fast Searching Problem
- On the Cutwidth and the Topological Bandwidth of a Tree
- The complexity of searching a graph
- A kuratowski theorem for the projective plane
- Monotonicity in graph searching
- Recontamination does not help to search a graph