Gallai-Ramsey numbers for graphs with chromatic number three
From MaRDI portal
Publication:2231752
DOI10.1016/j.dam.2021.07.024zbMath1473.05200arXiv2006.02603OpenAlexW3189722213MaRDI QIDQ2231752
Publication date: 30 September 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.02603
Related Items (5)
Gallai-Ramsey numbers for graphs with five vertices of chromatic number four ⋮ Gallai-Ramsey numbers for rainbow \(P_5\) and monochromatic fans or wheels ⋮ Gallai-Ramsey numbers involving a rainbow 4-path ⋮ Complete bipartite graphs without small rainbow stars ⋮ Ramsey and Gallai-Ramsey numbers for the union of paths and stars
Cites Work
- Unnamed Item
- Rainbow generalizations of Ramsey theory: A survey
- Edge-colored complete graphs with precisely colored subgraphs
- The Erdős-Hajnal conjecture for rainbow triangles
- Gallai-Ramsey numbers for books
- A note on Gallai-Ramsey number of even wheels
- Gallai-Ramsey numbers for a class of graphs with five vertices
- Ramsey and Gallai-Ramsey numbers for two classes of unicyclic graphs
- Ramsey-type results for Gallai colorings
- The Ramsey Numbers of Paths Versus Kipases
- Ramsey numbers for graphs with five vertices
- Edge colorings of complete graphs without tricolored triangles
- Gallai‐Ramsey number for K4
- Transitiv orientierbare Graphen
This page was built for publication: Gallai-Ramsey numbers for graphs with chromatic number three