Extremal problems for game domination number
From MaRDI portal
Recommendations
- Domination game on forests
- Domination game: extremal families for the 3/5-conjecture for forests
- Domination game: a proof of the 3/5-conjecture for graphs with minimum degree at least two
- Domination game: extremal families of graphs for \(3/5\)-conjectures
- Domination game played on trees and spanning subgraphs
Cited in
(88)- On the game total domination number
- Further progress on the heredity of the game domination number
- The 4/5 upper bound on the game total domination number
- Infinite families of circular and Möbius ladders that are total domination game critical
- Domination game and minimal edge cuts
- Cutting lemma and union lemma for the domination game
- Effect of predomination and vertex removal on the game total domination number of a graph
- Domination game on uniform hypergraphs
- On graphs with largest possible game domination number
- Game total domination critical graphs
- On domination game stable graphs and domination game edge-critical graphs
- The variety of domination games
- Domination game: effect of edge- and vertex-removal
- An integer programming approach for solving a generalized version of the Grundy domination number
- \( 1 / 2\)-conjectures on the domination game and claw-free graphs
- Connected domination game played on Cartesian products
- The domination game played on diameter 2 graphs
- Predominating a vertex in the connected domination game
- 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
- Realizations of the game domination number
- Game total domination for cyclic bipartite graphs
- Maker-breaker domination number
- Fractional domination game
- Trees with equal total domination and game total domination numbers
- The game total domination problem is log-complete in PSPACE
- Domination game: extremal families of graphs for \(3/5\)-conjectures
- Domination game on forests
- Progress towards the total domination game \(\frac{3}{4}\)-conjecture
- The 3/5-conjecture for weakly \(S(K_{1, 3})\)-free forests
- Uniform length dominating sequence graphs
- Perfect graphs for domination games
- Total dominating sequences in graphs
- The disjoint domination game
- On the computational complexity of the domination game
- Game total domination for cycles and paths
- Improved upper bounds on the domination number of graphs with minimum degree at least five
- Proof of a conjecture on game domination
- Complexity of the game domination problem
- Characterisation of forests with trivial game domination numbers
- Bounds on the game transversal number in hypergraphs
- An introduction to game domination in graphs
- Domination game: a proof of the 3/5-conjecture for graphs with minimum degree at least two
- THE DOMINATION GAME ON SPLIT GRAPHS
- The domination game played on unions of graphs
- Total version of the domination game
- Effect of vertex-removal on game total domination numbers
- Effect of an edge subdivision on game domination numbers
- scientific article; zbMATH DE number 7355464 (Why is no real title available?)
- On Rall's 1/2-conjecture on the domination game
- Connected domination game
- The independence coloring game on graphs
- Mycielskian of graphs with small game domination number
- Domination game played on a graph constructed from 1-sum of paths
- Domination game on powers of cycles
- The enclaveless competition game
- Total connected domination game
- Game domination numbers of a disjoint union of paths and cycles
- How long can one bluff in the domination game?
- Domination game: extremal families for the 3/5-conjecture for forests
- Paired-domination game played in graphs
- Guarded subgraphs and the domination game
- On graphs with small game domination number
- My favorite domination game conjectures
- My favorite domination conjectures in graph theory are bounded
- Domination games played on graphs
- Connected domination game: predomination, Staller-start game, and lexicographic products
- Graph-Theoretic Concepts in Computer Science
- Biased domination games
- Bounds for the competition-independence game on trees
- Fast winning strategies for staller in the maker-breaker domination game
- The cordiality game and the game cordiality number
- A proof of the 3/5-conjecture in the domination game
- Optimal strategies in fractional games: vertex cover and domination
- A note on the \(P_3\)-isolation number of a graph
- A proof of the 3/4-conjecture for the total domination game
- The burning game on graphs
- The normal domination game in graphs
- Complexity of the game connected domination problem
- Domination game: effect of edge contraction and edge subdivision
- Indicated total domination game
- Builder-blocker general position games
- Dominating sequences in graphs
- Maker-Breaker domination game
- On the game domination number of graphs with given minimum degree
- Domination game critical graphs
This page was built for publication: Extremal problems for game domination number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408611)
