Cycles Avoiding a Color in Colorful Graphs
From MaRDI portal
Publication:2800592
DOI10.1002/jgt.21879zbMath1371.05174OpenAlexW1771566388MaRDI QIDQ2800592
Janina Müttel, Dieter Rautenbach, Dirk Meierling
Publication date: 15 April 2016
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.21879
Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)
Cites Work
- Unnamed Item
- Unnamed Item
- The 3-colored Ramsey number of even cycles
- On the circumference of a graph and its complement
- All Ramsey numbers for cycles in graphs
- Ramsey numbers for cycles in graphs
- On a Ramsey-type problem of J. A. Bondy and P. Erdős. I
- Ramsey Results for Cycle Spectra
- On maximal paths and circuits of graphs
- On a Variation of the Ramsey Number
- Generalized and geometric Ramsey numbers for cycles.
This page was built for publication: Cycles Avoiding a Color in Colorful Graphs
