On graphs with small game domination number
From MaRDI portal
Publication:5279865
DOI10.2298/AADM160207003KzbMath1461.05141OpenAlexW2394944196MaRDI QIDQ5279865
Gašper Košmrlj, Sandi Klavžar, Simon Schmidt
Publication date: 19 July 2017
Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2298/aadm160207003k
Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (8)
Complexity of the game domination problem ⋮ Perfect graphs for domination games ⋮ On graphs with largest possible game domination number ⋮ The variety of domination games ⋮ On domination game stable graphs and domination game edge-critical graphs ⋮ An Introduction to Game Domination in Graphs ⋮ Connected domination game: Predomination, Staller-start game, and lexicographic products ⋮ Connected domination game
This page was built for publication: On graphs with small game domination number