Gallai-Ramsey numbers of odd cycles and complete bipartite graphs
From MaRDI portal
Publication:1756086
DOI10.1007/s00373-018-1931-7zbMath1402.05146OpenAlexW2889562718WikidataQ114229651 ScholiaQ114229651MaRDI QIDQ1756086
Yusheng Li, Chaoping Pei, Ming Chen
Publication date: 11 January 2019
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-018-1931-7
Related Items (12)
Gallai-Ramsey numbers for a class of graphs with five vertices ⋮ Gallai-Ramsey numbers involving a rainbow 4-path ⋮ Size Gallai-Ramsey number ⋮ All partitions have small parts -- Gallai-Ramsey numbers of bipartite graphs ⋮ Monochromatic stars in rainbow \(K_3\)-free and \(S_3^+\)-free colorings ⋮ Gallai-Ramsey numbers for multiple triangles ⋮ Gallai and \(\ell \)-uniform Ramsey numbers of complete bipartite graphs ⋮ A note on Gallai-Ramsey number of even wheels ⋮ Gallai-Ramsey number of even cycles with chords ⋮ The number of Gallai \(k\)-colorings of complete graphs ⋮ Gallai-Ramsey number of odd cycles with chords ⋮ Ramsey and Gallai-Ramsey numbers for the union of paths and stars
Cites Work
- Gallai-Ramsey numbers for cycles
- Rainbow generalizations of Ramsey theory: A survey
- Edge-colored complete graphs with precisely colored subgraphs
- All Ramsey numbers for cycles in graphs
- Multicolour Ramsey numbers of odd cycles
- A note on the monotonicity of mixed Ramsey numbers
- Multi-color Ramsey numbers of even cycles
- Ramsey functions involving \(K_{m,n}\) with \(n\) large
- Improved Upper Bounds for Gallai-Ramsey Numbers of Paths and Cycles
- Extensions of Gallai-Ramsey results
- Ramsey-type results for Gallai colorings
- On the multi-colored Ramsey numbers of cycles
- Edge colorings of complete graphs without tricolored triangles
- Transitiv orientierbare Graphen
This page was built for publication: Gallai-Ramsey numbers of odd cycles and complete bipartite graphs
