Gallai-Ramsey number of odd cycles with chords
From MaRDI portal
Publication:2080223
DOI10.1016/j.ejc.2022.103598zbMath1498.05183arXiv1809.00227OpenAlexW3084544366WikidataQ114184713 ScholiaQ114184713MaRDI QIDQ2080223
Zi-Xia Song, Yaojun Chen, Fangfang Zhang
Publication date: 7 October 2022
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.00227
Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Gallai-Ramsey numbers for cycles
- Rainbow generalizations of Ramsey theory: A survey
- Ramsey numbers for theta graphs
- Edge-colored complete graphs with precisely colored subgraphs
- Gallai colorings of non-complete graphs
- A note on perfect graphs
- Gallai-Ramsey numbers of \(C_7\) with multiple colors
- Gallai-Ramsey numbers of odd cycles and complete bipartite graphs
- Multicolour Ramsey numbers of odd cycles
- Gallai-Ramsey number of even cycles with chords
- Exact Ramsey numbers of odd cycles via nonlinear optimisation
- The Erdős-Hajnal conjecture for rainbow triangles
- A note on Gallai-Ramsey number of even wheels
- Ramsey numbers for cycles in graphs
- Correction to: ``Gallai-Ramsey numbers for a class of graphs with five vertices
- Improved Upper Bounds for Gallai-Ramsey Numbers of Paths and Cycles
- Ramsey-type results for Gallai colorings
- Edge colorings of complete graphs without tricolored triangles
- Gallai‐Ramsey number for K4
- A conjecture on Gallai-Ramsey numbers of even cycles and paths
- Transitiv orientierbare Graphen
- On the existence of specified cycles in complementary graphs
- Graph pairs and their entropies: Modularity problems
