Gallai-Ramsey numbers for a class of graphs with five vertices
From MaRDI portal
Publication:2657034
DOI10.1007/s00373-020-02194-5zbMath1459.05202arXiv1811.06134OpenAlexW3033655651MaRDI QIDQ2657034
Publication date: 17 March 2021
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.06134
Related Items
Gallai-Ramsey numbers for graphs with five vertices of chromatic number four, Gallai-Ramsey numbers involving a rainbow 4-path, Gallai-Ramsey numbers for graphs with chromatic number three, Ramsey and Gallai-Ramsey numbers for the union of paths and stars
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Gallai-Ramsey numbers for cycles
- Rainbow generalizations of Ramsey theory: A survey
- Edge-colored complete graphs with precisely colored subgraphs
- Small Ramsey numbers
- All partitions have small parts -- Gallai-Ramsey numbers of bipartite graphs
- Gallai-Ramsey numbers of odd cycles and complete bipartite graphs
- Ramsey and Gallai-Ramsey numbers for stars with extra independent edges
- Gallai-Ramsey numbers for books
- A note on the monotonicity of mixed Ramsey numbers
- On colorings avoiding a rainbow cycle and a fixed monochromatic subgraph
- Complete graphs and complete bipartite graphs without rainbow path
- Improved Upper Bounds for Gallai-Ramsey Numbers of Paths and Cycles
- Extensions of Gallai-Ramsey results
- Ramsey-type results for Gallai colorings
- Ramsey numbers for graphs with five vertices
- Edge colorings of complete graphs without tricolored triangles
- A conjecture on Gallai-Ramsey numbers of even cycles and paths
- Transitiv orientierbare Graphen