Transversal Game on Hypergraphs and the $\frac{3}{4}$-Conjecture on the Total Domination Game (Q2821619): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59072433, #quickstatements; #temporary_batch_1712201099914
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3993087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE COMPLEXITY OF SOME COLORING GAMES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toppling numbers of complete and random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Game list colouring of 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: Transversals and domination in uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total transversals and total domination in uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The disjoint domination game / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line Ramsey theory for bounded degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small transversals in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Game matching number of graphs / 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: Linear hypergraphs with large transversal number and maximum degree two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line Ramsey theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3575431 / 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: Hypergraphs with large transversal number and with edge sizes at least four / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraphs with large transversal number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transversals and matchings in 3-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum size transversals in uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mr. Paint and Mrs. Correct / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering all cliques of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2822601 / rank
 
Normal rank

Latest revision as of 14:17, 12 July 2024

scientific article
Language Label Description Also known as
English
Transversal Game on Hypergraphs and the $\frac{3}{4}$-Conjecture on the Total Domination Game
scientific article

    Statements

    Transversal Game on Hypergraphs and the $\frac{3}{4}$-Conjecture on the Total Domination Game (English)
    0 references
    0 references
    0 references
    0 references
    22 September 2016
    0 references
    total domination game
    0 references
    transversal
    0 references
    game transversal
    0 references
    hypergraph
    0 references

    Identifiers

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