scientific article
From MaRDI portal
Publication:3575431
zbMath1196.05053MaRDI QIDQ3575431
Paweł Prałat, Jarosław Grytczuk, Henry A. Kierstead
Publication date: 27 July 2010
Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/632/0.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Games involving graphs (91A43) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)
Related Items
A note on on-line Ramsey numbers for quadrilaterals ⋮ Bounds on the game transversal number in hypergraphs ⋮ Domination Game: A proof of the $3/5$-Conjecture for Graphs with Minimum Degree at Least Two ⋮ Paired-Domination Game Played in Graphs ⋮ On-line Ramsey numbers for paths and short cycles ⋮ Online Ramsey theory for planar graphs ⋮ Proper colouring painter-builder game ⋮ Off-diagonal online size Ramsey numbers for paths ⋮ On-line size Ramsey number for monotone \(k\)-uniform ordered paths with uniform looseness ⋮ On-line Ramsey numbers of paths and cycles ⋮ Unnamed Item ⋮ A note on restricted online Ramsey numbers of matchings ⋮ A note on on-line Ramsey numbers of stars and paths ⋮ Transversal Game on Hypergraphs and the $\frac{3}{4}$-Conjecture on the Total Domination Game ⋮ A strengthening of the Erdős-Szekeres theorem ⋮ Coloring random graphs online without creating monochromatic subgraphs
