Ramsey and Gallai-Ramsey number for wheels
From MaRDI portal
Publication:2115156
DOI10.1007/s00373-021-02406-6zbMath1485.05110arXiv1905.12414OpenAlexW4210737048MaRDI QIDQ2115156
Yaping Mao, Zhao Wang, Colton Magnant, Ingo Schiermeyer
Publication date: 15 March 2022
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.12414
Extremal problems in graph theory (05C35) Paths and cycles (05C38) 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 (5)
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 involving a rainbow 4-path ⋮ Size Gallai-Ramsey number ⋮ Complete bipartite graphs without small rainbow subgraphs
Cites Work
- Rainbow generalizations of Ramsey theory: A survey
- Extending cycles in graphs
- The Ramsey numbers for cycles versus wheels of odd order
- All Ramsey numbers for cycles in graphs
- Ramsey and Gallai-Ramsey numbers for stars with extra independent edges
- On a Ramsey-type problem of J. A. Bondy and P. Erdős. II
- Lambda composition
- Edge colorings of complete graphs without tricolored triangles
- Transitiv orientierbare Graphen
- Generalized and geometric Ramsey numbers for cycles.
This page was built for publication: Ramsey and Gallai-Ramsey number for wheels