Four-searchable biconnected outerplanar graphs

DOI10.1016/j.dam.2021.09.011zbMath1477.05176OpenAlexW3206686231MaRDI 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

zbMATH Keywords

outerplanar graphsgraph minorsforbidden minorsedge searching

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph minors (05C83)

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

This page was built for publication: Four-searchable biconnected outerplanar graphs