Gallai-Ramsey numbers for cycles
From MaRDI portal
Publication:539886
DOI10.1016/j.disc.2009.11.004zbMath1222.05186OpenAlexW1981902663MaRDI QIDQ539886
Publication date: 31 May 2011
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.11.004
Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)
Related Items (24)
A conjecture on Gallai-Ramsey numbers of even cycles and paths ⋮ Gallai-Ramsey numbers of $C_{10}$ and $C_{12}$ ⋮ 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 for a class of graphs with five vertices ⋮ Ramsey and Gallai-Ramsey numbers for two classes of unicyclic graphs ⋮ Rainbow generalizations of Ramsey theory: A survey ⋮ Gallai-Ramsey number for the union of stars ⋮ Gallai-Ramsey numbers involving a rainbow 4-path ⋮ Complete graphs and complete bipartite graphs without rainbow path ⋮ Complete bipartite graphs without small rainbow stars ⋮ A decomposition of Gallai multigraphs ⋮ Gallai-Ramsey numbers of \(C_7\) with multiple colors ⋮ Monochromatic subgraphs in the absence of a properly colored 4-cycle ⋮ Gallai-Ramsey numbers of odd cycles and complete bipartite graphs ⋮ Gallai-Ramsey numbers for monochromatic triangles or 4-cycles ⋮ Monochromatic stars in rainbow \(K_3\)-free and \(S_3^+\)-free colorings ⋮ Gallai-Ramsey numbers for books ⋮ 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 ⋮ Gallai-Ramsey number of an 8-cycle ⋮ Improved Upper Bounds for Gallai-Ramsey Numbers of Paths and Cycles ⋮ Gallai-Ramsey numbers for rainbow \(S_3^+\) and monochromatic paths
Cites Work
- Edge-colored complete graphs with precisely colored subgraphs
- Edge-colorings avoiding rainbow and monochromatic subgraphs
- All Ramsey numbers for cycles in graphs
- Ramsey numbers for cycles in graphs
- On a Ramsey-type problem of J. A. Bondy and P. Erdős. II
- Extensions of Gallai-Ramsey results
- Ramsey-type results for Gallai colorings
- Edge colorings of complete graphs without tricolored triangles
- Transitiv orientierbare Graphen
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Gallai-Ramsey numbers for cycles