On the public citation graph
On the Game Domination Number of Graphs with Given Minimum Degree
0 signed · 55 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/s00373-014-1470-9openalex-snapshot
Total Version of the Domination Game
inferredcites →https://doi.org/10.1007/s10878-012-9572-xopenalex-snapshot
Realizations of the game domination number
inferredcites →https://doi.org/10.1016/j.dam.2013.01.025openalex-snapshot
Domination game: Extremal families of graphs for 3/5 -conjectures
inferredcites →https://doi.org/10.1016/j.disc.2013.01.014openalex-snapshot
Domination game played on trees and spanning subgraphs
inferredcites →https://doi.org/10.1016/j.disc.2014.08.024openalex-snapshot
The domination game played on unions of graphs
inferredcites →https://doi.org/10.1016/j.disc.2015.05.022openalex-snapshot
Domination game on forests
inferredcites →https://doi.org/10.1137/100786800openalex-snapshot
Domination Game and an Imagination Strategy
inferredcites →https://doi.org/10.1137/120884742openalex-snapshot
Extremal Problems for Game Domination Number
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-58892-2_8openalex-snapshot
An Introduction to Game Domination in Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-97686-0_12openalex-snapshot
My Favorite Domination Game Conjectures
inferred← citeshttps://doi.org/10.1007/s00010-019-00661-wopenalex-snapshot
The variety of domination games
inferred← citeshttps://doi.org/10.1007/s00010-021-00786-xopenalex-snapshot
The domination game played on diameter 2 graphs
inferred← citeshttps://doi.org/10.1007/s00373-015-1585-7openalex-snapshot
Improved Upper Bounds on the Domination Number of Graphs With Minimum Degree at Least Five
inferred← citeshttps://doi.org/10.1007/s00373-018-1883-yopenalex-snapshot
On the Game Total Domination Number
inferred← citeshttps://doi.org/10.1007/s00493-015-3316-3openalex-snapshot
The 4/5 upper bound on the game total domination number
inferred← citeshttps://doi.org/10.1007/s40840-018-0635-8openalex-snapshot
Infinite Families of Circular and Möbius Ladders that are Total Domination Game Critical
inferred← citeshttps://doi.org/10.1007/s40840-019-00757-1openalex-snapshot
Maker–Breaker Domination Number
inferred← citeshttps://doi.org/10.1016/j.dam.2016.03.014openalex-snapshot
Game total domination for cycles and paths
inferred← citeshttps://doi.org/10.1016/j.dam.2017.05.014openalex-snapshot
Bounds on the 2 -domination number
inferred← citeshttps://doi.org/10.1016/j.dam.2018.04.014openalex-snapshot
Game total domination critical graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2018.05.027openalex-snapshot
On domination game stable graphs and domination game edge-critical graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2018.11.013openalex-snapshot
Domination game on uniform hypergraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2019.03.009openalex-snapshot
Game total domination for cyclic bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2019.11.004openalex-snapshot
Maker–Breaker total domination game
inferred← citeshttps://doi.org/10.1016/j.dam.2020.06.018openalex-snapshot
General upper bound on the game domination number
inferred← citeshttps://doi.org/10.1016/j.disc.2016.05.017openalex-snapshot
The 3/5-conjecture for weakly S ( K 1 , 3 ) -free forests
inferred← citeshttps://doi.org/10.1016/j.disc.2017.10.024openalex-snapshot
On graphs with largest possible game domination number
inferred← citeshttps://doi.org/10.1016/j.disc.2018.12.001openalex-snapshot
Domination game and minimal edge cuts
inferred← citeshttps://doi.org/10.1016/j.disc.2019.01.007openalex-snapshot
Cutting lemma and union lemma for the domination game
inferred← citeshttps://doi.org/10.1016/j.ejc.2021.103467openalex-snapshot
1 / 2 -conjectures on the domination game and claw-free graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2024.104034openalex-snapshot
A proof of the 3/5-conjecture in the domination game
inferred← citeshttps://doi.org/10.1016/j.entcs.2019.08.042openalex-snapshot
Fast Winning Strategies for the Maker-Breaker Domination Game
inferred← citeshttps://doi.org/10.1016/j.ipl.2017.05.007openalex-snapshot
The game total domination problem is log-complete in PSPACE
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.07.025openalex-snapshot
Complexity of the game domination problem
inferred← citeshttps://doi.org/10.1137/140976935openalex-snapshot
Domination Game: A proof of the $3/5$-Conjecture for Graphs with Minimum Degree at Least Two
inferred← citeshttps://doi.org/10.1137/23m1551584openalex-snapshot
A Proof of the 3/4-Conjecture for the Total Domination Game
inferred← citeshttps://doi.org/10.1201/9781482246582-9openalex-snapshot
Bounds on the Domination Number
inferred← citeshttps://doi.org/10.2298/aadm160207003kopenalex-snapshot
On graphs with small game domination number
inferred← citeshttps://doi.org/10.26493/1855-3974.2227.e1aopenalex-snapshot
The enclaveless competition game
inferred← citeshttps://doi.org/10.26493/1855-3974.891.e93openalex-snapshot
Domination game on paths and cycles
inferred← citeshttps://doi.org/10.26493/2590-9770.1484.40eopenalex-snapshot
Mycielskian of graphs with small game domination number
inferred← citeshttps://doi.org/10.2989/16073606.2020.1822945openalex-snapshot
On Rall's 1/2-conjecture on the domination game
inferred← citeshttps://doi.org/10.3390/math8030359openalex-snapshot
Competition-Independence Game and Domination Game
inferred← citeshttps://doi.org/10.48550/arxiv.1507.02875openalex-snapshot
The 3/5-conjecture for weakly $S(K_{1,3})$-free forests
inferred← citeshttps://doi.org/10.48550/arxiv.1603.01181openalex-snapshot
The Domination Game: Proving the 3/5 Conjecture on Isolate-Free Forests
inferred← citeshttps://doi.org/10.48550/arxiv.1612.08301openalex-snapshot
Bounds on the 2-domination number
inferred← citeshttps://doi.org/10.48550/arxiv.1706.01157openalex-snapshot
On the game total domination number
inferred← citeshttps://doi.org/10.48550/arxiv.1810.04397openalex-snapshot
Maker-Breaker domination number
inferred← citeshttps://doi.org/10.48550/arxiv.2010.14273openalex-snapshot
$1/2$-conjectures on the domination game and claw-free graphs
inferred← citeshttps://doi.org/10.7151/dmgt.1899openalex-snapshot
How long can one bluff in the domination game?
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.