Ramsey and Gallai-Ramsey numbers for the union of paths and stars
From MaRDI portal
Publication:2104951
DOI10.1016/j.dam.2022.10.022zbMath1504.05188OpenAlexW4309570716MaRDI QIDQ2104951
Yaping Mao, Meiqin Wei, Jiannan Zhou, Zhi-Hui Li
Publication date: 8 December 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2022.10.022
Generalized Ramsey theory (05C55) Ramsey theory (05D10) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On some three-color Ramsey numbers for paths
- All Ramsey numbers for brooms in graphs
- On the multicolor Ramsey number of a graph with \(m\) edges
- The Ramsey numbers for disjoint unions of trees
- Ramsey numbers for local colorings
- Ramsey numbers for matchings
- All partitions have small parts -- Gallai-Ramsey numbers of bipartite graphs
- Gallai-Ramsey numbers of odd cycles and complete bipartite graphs
- Gallai-Ramsey numbers for monochromatic triangles or 4-cycles
- Generalised Ramsey numbers for small graphs
- Distribution of colors in Gallai colorings
- Monochromatic stars in rainbow \(K_3\)-free and \(S_3^+\)-free colorings
- Gallai-Ramsey numbers for rainbow paths
- Gallai-Ramsey numbers for graphs with chromatic number three
- The Erdős-Hajnal conjecture for rainbow triangles
- Three-color Ramsey numbers for paths
- Complete graphs and complete bipartite graphs without rainbow path
- Generalized Ramsey theory for graphs. III: Small off-diagonal numbers
- Gallai-Ramsey numbers for a class of graphs with five vertices
- Extensions of Gallai-Ramsey results
- On maximal paths and circuits of graphs
- Complete graphs with no rainbow path
- Lambda composition
- Edge colorings of complete graphs without tricolored triangles
- The Gallai–Ramsey number for a tree versus complete graphs
- Complete graphs with no rainbow tree
- Gallai‐Ramsey number for K4
- Topics in Gallai-Ramsey Theory
- Transitiv orientierbare Graphen
- Gallai–Ramsey number for K5 ${K}_{5}$
- The Erdős–Gyárfás function with respect to Gallai‐colorings
This page was built for publication: Ramsey and Gallai-Ramsey numbers for the union of paths and stars
