A combinatorial game over biclique-hypergraphs of powers of paths and of powers of cycles through monochromatic transversals (Q2700612): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2023.03.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4327591606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring the Maximal Cliques of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transversal Game on Hypergraphs and the $\frac{3}{4}$-Conjecture on the Total Domination Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the game transversal number in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring clique-hypergraphs of circulant graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line Ramsey Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the generation of bicliques of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-colouring all two-element maximal antichains / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a combinatorial game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring the hypergraph of maximal cliques of a graph with no long path / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positional games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biclique-colouring verification complexity and biclique-colouring power graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicliques in graphs. I: Bounds on their number / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of some two-person perfect-information games / rank
 
Normal rank

Latest revision as of 01:09, 1 August 2024

scientific article
Language Label Description Also known as
English
A combinatorial game over biclique-hypergraphs of powers of paths and of powers of cycles through monochromatic transversals
scientific article

    Statements

    A combinatorial game over biclique-hypergraphs of powers of paths and of powers of cycles through monochromatic transversals (English)
    0 references
    0 references
    0 references
    0 references
    27 April 2023
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    combinatorial games
    0 references
    hypergraphs
    0 references
    transversal
    0 references
    bicliques
    0 references
    powers of paths
    0 references
    powers of cycles
    0 references
    0 references