Searching Cycle-Disjoint Graphs

DOI10.1007/978-3-540-73556-4_6MaRDI QIDQ3611949zbMATH OpenOpenAlexFDO

Authors Boting Yang, Runtao Zhang, Yi Cao

Publication date 3 March 2009

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73556-4_6

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Positional games (pursuit and evasion, etc.) (91A24) Games involving graphs (91A43)

Recommendations

• Computing the vertex separation of unicyclic graphs
• Connected graph searching for unicyclic graphs
• The complexity of searching a graph
• Fast searching games on graphs
• scientific article; zbMATH DE number 1222842

Cited in

(8)

• An efficient algorithm for searching implicit AND/OR graphs with cycles
• On the problem of finding disjoint cycles and dicycles in a digraph
• Connected graph searching for unicyclic graphs
• Edge search number of cographs
• Edge Search Number of Cographs in Linear Time
• Computing the vertex separation of unicyclic graphs
• The complexity of zero-visibility cops and robber
• An annotated bibliography on guaranteed graph searching

This page was built for publication: Searching Cycle-Disjoint Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3611949)