Online Ramsey theory for planar graphs
From MaRDI portal
Publication:405170
zbMath1300.05175MaRDI QIDQ405170
Publication date: 4 September 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i1p65
Games involving graphs (91A43) Planar graphs; geometric and topological aspects of graph theory (05C10) Generalized Ramsey theory (05C55) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (2)
On the computational complexity and strategies of online Ramsey theory ⋮ On-line size Ramsey number for monotone \(k\)-uniform ordered paths with uniform looseness
Cites Work
- Unnamed Item
- Unnamed Item
- On-line Ramsey theory for bounded degree graphs
- On-line Ramsey theory
- Coloring number and on-line Ramsey theory for graphs and hypergraphs
- On-line Ramsey Numbers
- On size Ramsey number of paths, trees, and circuits. I
- The Induced Size-Ramsey Number of Cycles
- Two variants of the size Ramsey number
This page was built for publication: Online Ramsey theory for planar graphs