On the computational complexity and strategies of online Ramsey theory (Q322363): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4284608 / 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: On-line Ramsey Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey Games Against a One-Armed Bandit / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line Ramsey theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring number and on-line Ramsey theory for graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Ramsey theory for planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees with an on-line degree Ramsey number of four / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Ramsey theory and the polynomial hierarchy / rank
 
Normal rank

Revision as of 17:27, 12 July 2024

scientific article
Language Label Description Also known as
English
On the computational complexity and strategies of online Ramsey theory
scientific article

    Statements

    On the computational complexity and strategies of online Ramsey theory (English)
    0 references
    0 references
    0 references
    14 October 2016
    0 references
    online Ramsey game
    0 references
    complexity
    0 references
    strategy
    0 references

    Identifiers

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