Pages that link to "Item:Q551227"

The following pages link to On-line Ramsey theory for bounded degree graphs (Q551227):

Displaying 11 items.

• On the computational complexity and strategies of online Ramsey theory (Q322363) (← links)
• Bounds on the game transversal number in hypergraphs (Q326647) (← links)
• The on-line degree Ramsey number of cycles (Q390276) (← links)
• Online Ramsey theory for planar graphs (Q405170) (← links)
• Online Ramsey games for triangles in random graphs (Q607029) (← links)
• A note on on-line Ramsey numbers of stars and paths (Q2049035) (← links)
• On-line size Ramsey number for monotone \(k\)-uniform ordered paths with uniform looseness (Q2225445) (← links)
• Transversal Game on Hypergraphs and the $\frac{3}{4}$-Conjecture on the Total Domination Game (Q2821619) (← links)
• Domination Game: A proof of the $3/5$-Conjecture for Graphs with Minimum Degree at Least Two (Q3462542) (← links)
• Paired-Domination Game Played in Graphs (Q5242939) (← links)
• Coloring random graphs online without creating monochromatic subgraphs (Q5495876) (← links)