Improved Upper Bounds for Gallai-Ramsey Numbers of Paths and Cycles
- 31 January 2013
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 75 (1) , 59-74
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Gallai–Ramsey numbers for cyclesDiscrete Mathematics, 2011
- Rainbow Generalizations of Ramsey Theory: A SurveyGraphs and Combinatorics, 2010
- Ramsey‐type results for Gallai coloringsJournal of Graph Theory, 2009
- Edge-colorings avoiding rainbow and monochromatic subgraphsDiscrete Mathematics, 2007
- Edge colorings of complete graphs without tricolored trianglesJournal of Graph Theory, 2004
- Lambda compositionJournal of Graph Theory, 1997
- Edge-colored complete graphs with precisely colored subgraphsCombinatorica, 1983
- Ramsey numbers for cycles in graphsJournal of Combinatorial Theory, Series B, 1973
- Transitiv orientierbare GraphenActa Mathematica Hungarica, 1967