Graph searching on some subclasses of chordal graphs

DOI10.1007/s004530010026zbMath0955.05074OpenAlexW1983243209MaRDI QIDQ1578423

N. Delaunay

Publication date: 12 February 2001

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004530010026

zbMATH Keywords

algorithmsplit graphinterval graphgraph searchingnode searchedge searchstar-like graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (10)

Edge Search Number of Cographs in Linear Time ⋮ Mixed Search Number of Permutation Graphs ⋮ Edge search number of cographs ⋮ Mixed Search Number and Linear-Width of Interval and Split Graphs ⋮ An annotated bibliography on guaranteed graph searching ⋮ Node-searching problem on block graphs ⋮ On the interval completion of chordal graphs ⋮ Pursuing a fast robber on a graph ⋮ Mixed search number and linear-width of interval and split graphs ⋮ Exclusive graph searching vs. pathwidth

This page was built for publication: Graph searching on some subclasses of chordal graphs