How long can one bluff in the domination game? (Q521751): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.7151/dmgt.1899 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.7151/dmgt.1899 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2600235998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination game: effect of edge- and vertex-removal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating sequences in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination game: extremal families of graphs for \(3/5\)-conjectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5249234 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination Game and an Imagination Strategy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination game on forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the game domination number of graphs with given minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved upper bounds on the domination number of graphs with minimum degree at least five / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination game critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The disjoint domination game / rank
 
Normal rank
Property / cites work
 
Property / cites work: The domination game played on unions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5625213 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination Game: A proof of the $3/5$-Conjecture for Graphs with Minimum Degree at Least Two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total version of the domination game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal dominating sets of cardinality two in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal Problems for Game Domination Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realizations of the game domination number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterisation of forests with trivial game domination numbers / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.7151/DMGT.1899 / rank
 
Normal rank

Latest revision as of 20:20, 9 December 2024

scientific article
Language Label Description Also known as
English
How long can one bluff in the domination game?
scientific article

    Statements

    How long can one bluff in the domination game? (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 April 2017
    0 references
    domination game
    0 references
    game domination number
    0 references
    bluff graphs
    0 references
    minus graphs
    0 references
    generalized Petersen graphs
    0 references
    Kneser graphs
    0 references
    Cartesian product of graphs
    0 references
    Hamming graphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references