On the public citation graph
Fractional Domination Game
0 signed · 38 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/bf01787474openalex-snapshot
Transversal numbers of uniform hypergraphs
inferredcites →https://doi.org/10.1007/s00373-014-1470-9openalex-snapshot
Total Version of the Domination Game
inferredcites →https://doi.org/10.1007/s00373-018-1883-yopenalex-snapshot
On the Game Total Domination Number
inferredcites →https://doi.org/10.1007/s00493-015-3316-3openalex-snapshot
The 4/5 upper bound on the game total domination number
inferredcites →https://doi.org/10.1007/s10878-015-9903-9openalex-snapshot
Characterisation of forests with trivial game domination numbers
inferredcites →https://doi.org/10.1016/0166-218x(84)90061-1openalex-snapshot
Domination, independent domination, and duality in strongly chordal graphs
inferredcites →https://doi.org/10.1016/j.dam.2016.03.014openalex-snapshot
Game total domination for cycles and paths
inferredcites →https://doi.org/10.1016/j.dam.2018.04.014openalex-snapshot
Game total domination critical graphs
inferredcites →https://doi.org/10.1016/j.dam.2018.05.027openalex-snapshot
On domination game stable graphs and domination game edge-critical graphs
inferredcites →https://doi.org/10.1016/j.dam.2018.09.011openalex-snapshot
Effect of predomination and vertex removal on the game total domination number of a graph
inferredcites →https://doi.org/10.1016/j.dam.2018.11.013openalex-snapshot
Domination game on uniform hypergraphs
inferredcites →https://doi.org/10.1016/j.disc.2014.04.015openalex-snapshot
Domination game: Effect of edge- and vertex-removal
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.04.028openalex-snapshot
The Disjoint Domination Game
inferredcites →https://doi.org/10.1016/j.disc.2015.05.022openalex-snapshot
Domination game on forests
inferredcites →https://doi.org/10.1016/j.disc.2017.10.024openalex-snapshot
On graphs with largest possible game domination number
inferredcites →https://doi.org/10.1016/j.disc.2018.12.001openalex-snapshot
Domination game and minimal edge cuts
inferredcites →https://doi.org/10.1016/j.ejc.2016.07.003openalex-snapshot
Bounds on the game transversal number in hypergraphs
inferredcites →https://doi.org/10.1016/j.tcs.2016.07.025openalex-snapshot
Complexity of the game domination problem
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
inferredcites →https://doi.org/10.1137/140976935openalex-snapshot
Domination Game: A proof of the $3/5$-Conjecture for Graphs with Minimum Degree at Least Two
inferredcites →https://doi.org/10.26493/1855-3974.891.e93openalex-snapshot
Domination game on paths and cycles
inferredcites →https://doi.org/10.37236/4497openalex-snapshot
On the Game Domination Number of Graphs with Given Minimum Degree
inferredcites →https://doi.org/10.48550/arxiv.1507.02875openalex-snapshot
The 3/5-conjecture for weakly $S(K_{1,3})$-free forests
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-69087-8_5openalex-snapshot
Related Games on Graphs and Hypergraphs
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-022-02478-yopenalex-snapshot
Predominating a Vertex in the Connected 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.1137/23m1551584openalex-snapshot
A Proof of the 3/4-Conjecture for the Total Domination Game
inferred← citeshttps://doi.org/10.26493/1855-3974.2771.4dfopenalex-snapshot
Optimal strategies in fractional games: vertex cover and domination
inferred← citeshttps://doi.org/10.26493/1855-3974.3205.3d6openalex-snapshot
Indicated total domination game
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.46298/dmtcs.8529openalex-snapshot
Maker-Breaker total domination game on cubic graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2105.03890openalex-snapshot
Optimal strategies in fractional games: vertex cover and domination
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.