Search problems on graphs of regular polyhedra

DOI10.1515/DMA.1996.6.3.233MaRDI QIDQ3125952zbMATH OpenOpenAlexFDO

Authors N. N. Petrov

Publication date 23 March 1997

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/dma.1996.6.3.233

zbMATH Keywords

\(n\)-search number of a graph

Mathematics Subject Classification ID

Graph theory (05C99) Positional games (pursuit and evasion, etc.) (91A24) Games involving graphs (91A43)

Recommendations

• scientific article; zbMATH DE number 1149743
• scientific article; zbMATH DE number 1164584
• The \(k\)-search number of graphs of regular polyhedra

Cited in

(8)

• Polyhedra with high-density graphs and polynomial-time solvability of combinatorial optimization problems
• The \(k\)-search number of graphs of regular polyhedra
• The theory of guaranteed search on graphs
• The search and the node-search number of dual graphs
• scientific article; zbMATH DE number 5726869 (Why is no real title available?)
• scientific article; zbMATH DE number 1164584 (Why is no real title available?)
• Search in graphs
• An annotated bibliography on guaranteed graph searching

This page was built for publication: Search problems on graphs of regular polyhedra

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