Extensions of Gallai-Ramsey results
From MaRDI portal
Publication:2911491
DOI10.1002/jgt.20622zbMath1247.05149OpenAlexW1539472514MaRDI QIDQ2911491
Publication date: 31 August 2012
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20622
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)
Related Items (18)
Gallai-Ramsey numbers for rainbow \(P_5\) and monochromatic fans or wheels ⋮ Gallai-Ramsey numbers for a class of graphs with five vertices ⋮ Rainbow generalizations of Ramsey theory: A survey ⋮ Gallai-Ramsey numbers involving a rainbow 4-path ⋮ Complete graphs and complete bipartite graphs without rainbow path ⋮ Complete bipartite graphs without small rainbow stars ⋮ Complete bipartite graphs without small rainbow subgraphs ⋮ A decomposition of Gallai multigraphs ⋮ Extremal problems and results related to Gallai-colorings ⋮ 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 cycles ⋮ Monochromatic stars in rainbow \(K_3\)-free and \(S_3^+\)-free colorings ⋮ A note on the monotonicity of mixed Ramsey numbers ⋮ Edge-colored complete graphs containing no properly colored odd cycles ⋮ Disconnected Colors in Generalized Gallai-Colorings ⋮ Ramsey and Gallai-Ramsey numbers for the union of paths and stars ⋮ Gallai-Ramsey numbers for rainbow \(S_3^+\) and monochromatic paths
Cites Work
- Unnamed Item
- Edge-colored complete graphs with precisely colored subgraphs
- Colored graphs without colorful cycles
- Long heterochromatic paths in heterochromatic triangle free graphs
- Complete graphs with no rainbow path
- Edge colorings of complete graphs without tricolored triangles
- Local Anti-Ramsey Numbers of Graphs
This page was built for publication: Extensions of Gallai-Ramsey results
