Gallai-Ramsey numbers for graphs with five vertices of chromatic number four

zbMath1490.05179arXiv2008.00361MaRDI QIDQ5863481

Bing Wei, Qinghong Zhao

Publication date: 1 June 2022

Full work available at URL: https://arxiv.org/abs/2008.00361

zbMATH Keywords

edge coloring of a complete graphisolated-free graphs with five vertices

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items (1)

Complete bipartite graphs without small rainbow stars

Cites Work

• Unnamed Item
• Gallai-Ramsey numbers for cycles
• Rainbow generalizations of Ramsey theory: A survey
• Edge-colored complete graphs with precisely colored subgraphs
• Small Ramsey numbers
• All partitions have small parts -- Gallai-Ramsey numbers of bipartite graphs
• Gallai-Ramsey number of even cycles with chords
• Ramsey and Gallai-Ramsey number for wheels
• Ramsey and Gallai-Ramsey numbers for stars with extra independent edges
• Gallai-Ramsey numbers for graphs with chromatic number three
• The Erdős-Hajnal conjecture for rainbow triangles
• Gallai-Ramsey numbers for books
• A note on Gallai-Ramsey number of even wheels
• Gallai-Ramsey numbers for a class of graphs with five vertices
• Ramsey and Gallai-Ramsey numbers for two classes of unicyclic graphs
• Ramsey-type results for Gallai colorings
• Ramsey numbers for graphs with five vertices
• Some small ramsey numbers
• Edge colorings of complete graphs without tricolored triangles
• Gallai‐Ramsey number for K4
• Transitiv orientierbare Graphen
• Combinatorial Relations and Chromatic Graphs

This page was built for publication: Gallai-Ramsey numbers for graphs with five vertices of chromatic number four