Monochromatic subgraphs in iterated triangulations

DOI10.37236/9292zbMath1451.05152arXiv1912.00123OpenAlexW3094898849MaRDI QIDQ2209888

Jie Ma, Xingxing Yu, Tianyun Tang

Publication date: 5 November 2020

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

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

zbMATH Keywords

2-edge-coloring of \(\text{Tr}(n)\)

Mathematics Subject Classification ID

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

Cites Work

• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• The star arboricity of graphs
• Star arboricity of graphs
• Planar Ramsey graphs
• On the degrees of the vertices of a directed graph
• 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

This page was built for publication: Monochromatic subgraphs in iterated triangulations