Monotonicity of the search number in the Golovach problem

DOI10.3103/S1063454111040029MaRDI QIDQ357743zbMATH OpenOpenAlexFDO

Authors T. V. Abramovskaya, N. N. Petrov

Publication date 13 August 2013

Published in Vestnik St. Petersburg University. Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3103/s1063454111040029

zbMATH Keywords

\(\varepsilon\)-search problemGolovach function

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Games on graphs (graph-theoretic aspects) (05C57) Positional games (pursuit and evasion, etc.) (91A24)

Recommendations

• On some problems of guaranteed search on graphs
• Nontrivial discontinuities of the Golovach functions for trees
• Arbitrarily large jumps of the Golovach function for trees
• Graph searching games with a radius of capture
• Discrete search programs on graphs

Cites work

• scientific article; zbMATH DE number 4156240 (Why is no real title available?)
• On some problems of guaranteed search on graphs
• Search in graphs

Cited in

(5)

• The realizability problem for Golovach-type functions
• Nontrivial discontinuities of the Golovach functions for trees
• On some problems of guaranteed search on graphs
• The theory of guaranteed search on graphs
• Graph searching games with a radius of capture

This page was built for publication: Monotonicity of the search number in the Golovach problem

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