Extensions of Gallai-Ramsey results
From MaRDI portal
Publication:2911491
DOI10.1002/jgt.20622zbMath1247.05149MaRDI 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
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C15: Coloring of graphs and hypergraphs
05C55: Generalized Ramsey theory
Related Items
Gallai-Ramsey numbers involving a rainbow 4-path, Complete bipartite graphs without small rainbow stars, Complete bipartite graphs without small rainbow subgraphs, Gallai-Ramsey numbers for cycles, Rainbow generalizations of Ramsey theory: A survey, Monochromatic subgraphs in the absence of a properly colored 4-cycle, Gallai-Ramsey numbers of odd cycles and complete bipartite graphs, Extremal problems and results related to Gallai-colorings, Monochromatic stars in rainbow \(K_3\)-free and \(S_3^+\)-free colorings, Edge-colored complete graphs containing no properly colored odd cycles, Ramsey and Gallai-Ramsey numbers for the union of paths and stars, Gallai-Ramsey numbers for rainbow \(S_3^+\) and monochromatic paths, Gallai-Ramsey numbers for rainbow \(P_5\) and monochromatic fans or wheels, A note on the monotonicity of mixed Ramsey numbers, Complete graphs and complete bipartite graphs without rainbow path, A decomposition of Gallai multigraphs, Gallai-Ramsey numbers for a class of graphs with five vertices, Disconnected Colors in Generalized Gallai-Colorings
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
