Ramsey and Gallai-Ramsey Numbers for Two Classes of Unicyclic Graphs
- 6 November 2020
- journal article
- research article
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 37 (1) , 337-354
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Science Foundation of China (12061059, 11601254, 11551001, 11161037, 61763041, 11661068, 11461054)
- Qinghai Key Laboratory of Internet of Things Project (2017-ZJ-Y21)
This publication has 13 references indexed in Scilit:
- Rainbow generalizations of Ramsey theory - a dynamic surveyTheory and Applications of Graphs, 2014
- Improved Upper Bounds for Gallai-Ramsey Numbers of Paths and CyclesJournal of Graph Theory, 2013
- Gallai–Ramsey numbers for cyclesDiscrete Mathematics, 2011
- Ramsey‐type results for Gallai coloringsJournal of Graph Theory, 2009
- Edge colorings of complete graphs without tricolored trianglesJournal of Graph Theory, 2004
- Generalized and geometric Ramsey numbers for cyclesTheoretical Computer Science, 2001
- All Ramsey numbers for cycles in graphsDiscrete Mathematics, 1974
- On a ramsey-type problem of J. A. Bondy and P. Erdös. IJournal of Combinatorial Theory, Series B, 1973
- Transitiv orientierbare GraphenActa Mathematica Hungarica, 1967
- Some Theorems on Abstract GraphsProceedings of the London Mathematical Society, 1952