Ramsey and Gallai-Ramsey numbers for two classes of unicyclic graphs
From MaRDI portal
Publication:2657090
DOI10.1007/s00373-020-02248-8zbMath1459.05205arXiv1809.10298OpenAlexW3096952549MaRDI QIDQ2657090
Yaping Mao, Jinyu Zou, Zhao Wang, Colton Magnant
Publication date: 17 March 2021
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.10298
Related Items (4)
Gallai-Ramsey numbers for graphs with five vertices of chromatic number four ⋮ Gallai-Ramsey numbers involving a rainbow 4-path ⋮ Complete bipartite graphs without small rainbow stars ⋮ Gallai-Ramsey numbers for graphs with chromatic number three
Cites Work
- Gallai-Ramsey numbers for cycles
- Rainbow generalizations of Ramsey theory: A survey
- All Ramsey numbers for cycles in graphs
- Ramsey and Gallai-Ramsey numbers for stars with extra independent edges
- Gallai-Ramsey numbers for books
- On a Ramsey-type problem of J. A. Bondy and P. Erdős. I
- Improved Upper Bounds for Gallai-Ramsey Numbers of Paths and Cycles
- Ramsey-type results for Gallai colorings
- Lambda composition
- Edge colorings of complete graphs without tricolored triangles
- Transitiv orientierbare Graphen
- Some Theorems on Abstract Graphs
- Generalized and geometric Ramsey numbers for cycles.
This page was built for publication: Ramsey and Gallai-Ramsey numbers for two classes of unicyclic graphs