Planar Ramsey graphs

zbMath1422.05066arXiv1812.00832MaRDI QIDQ2327223

Carsten Thomassen, Ursula Schade, Torsten Ueckerdt, Maria A. Axenovich

Publication date: 14 October 2019

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.00832

zbMATH Keywords

factorizationRamsey graphplanar unavoidable graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items

Ramsey properties of products of chains ⋮ Note on (semi-)proper orientation of some triangulated planar graphs ⋮ Monochromatic subgraphs in iterated triangulations

Cites Work

• The Ramsey property for graphs with forbidden complete subgraphs
• Every planar map is four colorable. I: Discharging
• Planar Ramsey numbers
• The star arboricity of graphs
• Star arboricity of graphs
• Caterpillar arboricity of planar graphs
• Planar graph coloring avoiding monochromatic subgraphs: Trees and paths make it difficult
• On the degrees of the vertices of a directed graph
• Edge-Disjoint Spanning Trees of Finite Graphs
• On the linear vertex-arboricity of a planar graph
• Edge partition of planar sraphs into two outerplanar graphs
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• The Game of Hex and the Brouwer Fixed-Point Theorem
• Bounded diameter arboricity
• Planar Ramsey Numbers
• The Analogue of Ramsey Numbers for Planar Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item