Online Ramsey theory for planar graphs
zbMATH Open1300.05175MaRDI QIDQ405170FDOQ405170
Authors: Šárka Petříčková 
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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Generalized Ramsey theory (05C55) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)
Cites Work
- On size Ramsey number of paths, trees, and circuits. I
- The Induced Size-Ramsey Number of Cycles
- Title not available (Why is that?)
- On-line Ramsey theory
- Coloring number and on-line Ramsey theory for graphs and hypergraphs
- On-line Ramsey Numbers
- On-line Ramsey numbers for paths and stars
- On-line Ramsey theory for bounded degree graphs
- Two variants of the size Ramsey number
Cited In (7)
- On induced online Ramsey number of paths, cycles, and trees
- Online Ramsey theory for a triangle on \(F\)-free graphs
- On the computational complexity and strategies of online Ramsey theory
- A note on restricted online Ramsey numbers of matchings
- On-line Ramsey numbers of paths and cycles
- On-line size Ramsey number for monotone \(k\)-uniform ordered paths with uniform looseness
- On-line Ramsey theory
This page was built for publication: Online Ramsey theory for planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405170)
