Maker-breaker domination number (Q2317950): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q128120402, #quickstatements; #temporary_batch_1722437626092
 
(5 intermediate revisions by 5 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2896317154 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1810.04397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biased positional games for which random strategies are nearly optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Resilience and Hamiltonicity Maker–Breaker Games in Random Regular Graphs / 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 played on trees and spanning subgraphs / 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: Fast Strategies In Maker–Breaker Games Played on Random Boards / rank
 
Normal rank
Property / cites work
 
Property / cites work: How fast can maker win in fair biased games? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the maximum number of minimum dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Game total domination for cycles and paths / 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: Maker-Breaker domination game / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a combinatorial game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Winning Strategies in Random‐Turn Maker–Breaker Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast winning strategies in maker-breaker games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positional games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination game: extremal families for the 3/5-conjecture for forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees with equal total domination and game total domination numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination game on paths and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal Problems for Game Domination Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterisation of forests with trivial game domination numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 3/5-conjecture for weakly \(S(K_{1, 3})\)-free forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs with largest possible game domination number / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128120402 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:02, 31 July 2024

scientific article
Language Label Description Also known as
English
Maker-breaker domination number
scientific article

    Statements

    Maker-breaker domination number (English)
    0 references
    0 references
    0 references
    0 references
    13 August 2019
    0 references
    maker-breaker domination game
    0 references
    maker-breaker domination number
    0 references
    domination game
    0 references
    perfect matching
    0 references
    tree
    0 references
    cycle
    0 references
    union of graphs
    0 references

    Identifiers

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