Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Some generalizations of the problem on the search number of a graph

From MaRDI portal
Publication:1373627
Jump to:navigation, search

zbMath0883.90149MaRDI QIDQ1373627

N. N. Petrov, Petr A. Golovach

Publication date: 20 November 1997

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


zbMATH Keywords

\(k\)-search number of a graph


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Search theory (90B40) Games involving graphs (91A43)


Related Items

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 ⋮ The theory of guaranteed search on graphs ⋮ An annotated bibliography on guaranteed graph searching ⋮ Mixed search number and linear-width of interval and split graphs



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1373627&oldid=13521123"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 16:10.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki