Connected Graph Searching in Outerplanar Graphs

DOI10.1016/j.endm.2005.06.032zbMath1200.68170DBLPjournals/endm/FominTT05OpenAlexW2031760049WikidataQ60488766 ScholiaQ60488766MaRDI QIDQ3439336

Fedor V. Fomin, Dimitrios M. Thilikos, Ioan Todinca

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2005.06.032

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

Connected search for a lazy robber ⋮ Network decontamination under \(m\)-immunity ⋮ An annotated bibliography on guaranteed graph searching ⋮ Connected graph searching ⋮ Connected searching of weighted trees ⋮ Finding small-width connected path decompositions in polynomial time

Cites Work

• Call routing and the ratcatcher
• Chordal embeddings of planar graphs
• Approximation of pathwidth of outerplanar graphs
• Graph-Theoretic Concepts in Computer Science

This page was built for publication: Connected Graph Searching in Outerplanar Graphs