The realizability problem for Golovach-type functions

DOI10.3103/S1063454112020021zbMath1338.90420OpenAlexW2051963389MaRDI QIDQ276878

Tanya V. Abramovskaya

Publication date: 4 May 2016

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

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Monotonicity of the search number in the Golovach problem
• Nontrivial discontinuities of the Golovach functions for trees
• Arbitrarily large jumps of the Golovach function for trees
• On some problems of guaranteed search on graphs
• Minimal trees of a given search number

This page was built for publication: The realizability problem for Golovach-type functions