Gallai colorings of non-complete graphs

DOI10.1016/j.disc.2009.10.013zbMath1230.05128MaRDI QIDQ966033

András Gyárfás, Gábor N. Sárközy

Publication date: 27 April 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.10.013

zbMATH Keywords

Gallai colorings; monochromatic connected components

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

Related Items

Gallai colorings and domination in multipartite digraphs, Gallai-Ramsey numbers of $C_{10}$ and $C_{12}$, The Typical Structure of Gallai Colorings and Their Extremal Graphs, A conjecture on Gallai-Ramsey numbers of even cycles and paths, Connected colourings of complete graphs and hypergraphs, Partitioning 2-edge-colored graphs by monochromatic paths and cycles, The number of Gallai \(k\)-colorings of complete graphs, Gallai-Ramsey numbers of \(C_7\) with multiple colors, Gallai and \(\ell \)-uniform Ramsey numbers of complete bipartite graphs, Edge-colored complete graphs containing no properly colored odd cycles, Gallai-Ramsey number of even cycles with chords, Gallai-Ramsey number of odd cycles with chords, The Erdős-Hajnal conjecture for rainbow triangles, Counting Gallai 3-colorings of complete graphs, Complete edge-colored permutation graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A note on perfect graphs
• Maximum degree and fractional matchings in uniform hypergraphs
• Perfect couples of graphs
• Ramsey-type results for Gallai colorings
• Large Monochromatic Components in Edge Colorings of Graphs: A Survey
• Edge colorings of complete graphs without tricolored triangles
• The Ramsey number R(3, t) has order of magnitude t²/log t
• Transitiv orientierbare Graphen
• Graph pairs and their entropies: Modularity problems