On graphs with largest possible game domination number
From MaRDI portal
(Redirected from Publication:1744764)
Recommendations
Cites work
- Characterisation of forests with trivial game domination numbers
- Complexity of the game domination problem
- Domination game and an imagination strategy
- Domination game critical graphs
- Domination game on forests
- Domination game on paths and cycles
- Domination game played on trees and spanning subgraphs
- Domination game: a proof of the 3/5-conjecture for graphs with minimum degree at least two
- Domination game: extremal families for the 3/5-conjecture for forests
- Domination game: extremal families of graphs for \(3/5\)-conjectures
- Extremal problems for game domination number
- How long can one bluff in the domination game?
- On graphs with small game domination number
- On the game domination number of graphs with given minimum degree
- Realizations of the game domination number
- The 3/5-conjecture for weakly \(S(K_{1, 3})\)-free forests
- The 4/5 upper bound on the game total domination number
- The disjoint domination game
- The domination game played on unions of graphs
- Total version of the domination game
- Trees with equal total domination and game total domination numbers
Cited in
(25)- Domination games on infinite graphs
- Further progress on the heredity of the game domination number
- Domination game and minimal edge cuts
- Cutting lemma and union lemma for the domination game
- Domination game on uniform hypergraphs
- On domination game stable graphs and domination game edge-critical graphs
- A formula with its applications on the difference of Zagreb indices of graphs
- The variety of domination games
- The domination game played on diameter 2 graphs
- Fast winning strategies for the maker-breaker domination game
- Maker-breaker total domination game
- General upper bound on the game domination number
- Z-domination game
- Maker-breaker domination number
- Fractional domination game
- An introduction to game domination in graphs
- scientific article; zbMATH DE number 7355464 (Why is no real title available?)
- scientific article; zbMATH DE number 7386901 (Why is no real title available?)
- Connected domination game
- Game $k$-Domination Number of Graphs
- Mycielskian of graphs with small game domination number
- Connected domination game: predomination, Staller-start game, and lexicographic products
- Indicated domination game
- Optimal strategies in fractional games: vertex cover and domination
- Domination game: effect of edge contraction and edge subdivision
This page was built for publication: On graphs with largest possible game domination number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1744764)