Gallai colorings of non-complete graphs

DOI10.1016/J.DISC.2009.10.013MaRDI QIDQ966033zbMATH OpenOpenAlexFDO

Authors 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 coloringsmonochromatic connected components

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Connected colourings of complete graphs and hypergraphs
• Disconnected colors in generalized Gallai-colorings
• Ramsey-type results for Gallai colorings
• Gallai-Ramsey numbers for multiple triangles
• Edge colorings of complete graphs without tricolored triangles

Cites work

• scientific article; zbMATH DE number 1017008 (Why is no real title available?)
• A note on perfect graphs
• A translation of Gallai's paper: `Transitiv orientierbare Graphen'
• Edge colorings of complete graphs without tricolored triangles
• Graph pairs and their entropies: Modularity problems
• Large monochromatic components in edge colorings of graphs: A survey
• Maximum degree and fractional matchings in uniform hypergraphs
• Perfect couples of graphs
• Ramsey-type results for Gallai colorings
• The Ramsey number R(3, t) has order of magnitude t²/log t
• Transitiv orientierbare Graphen

Cited in

(23)

• Gallai-colorings of triples and 2-factors of \(\mathcal{B}_3\)
• Edge-colored complete graphs containing no properly colored odd cycles
• A conjecture on Gallai-Ramsey numbers of even cycles and paths
• Counting Gallai 3-colorings of complete graphs
• Gallai-Ramsey numbers of C₇ with multiple colors
• Gallai and \(\ell \)-uniform Ramsey numbers of complete bipartite graphs
• Partitioning 2-edge-colored graphs by monochromatic paths and cycles
• The Erdős-Hajnal conjecture for rainbow triangles
• Partition of graphs and hypergraphs into monochromatic connected parts
• scientific article; zbMATH DE number 5130733 (Why is no real title available?)
• Edge colorings of complete graphs without tricolored triangles
• Colored graphs without colorful cycles
• Gallai colorings and domination in multipartite digraphs
• Disconnected colors in generalized Gallai-colorings
• The Typical Structure of Gallai Colorings and Their Extremal Graphs
• The number of Gallai k-colorings of complete graphs
• Complete edge-colored permutation graphs
• Gallai-Ramsey numbers of \(C_{10}\) and \(C_{12}\)
• Gallai-Ramsey number of even cycles with chords
• Connected colourings of complete graphs and hypergraphs
• Not complementary connected and not CIS \(d\)-graphs form weakly monotone families
• Gallai-Ramsey number of odd cycles with chords
• A decomposition of Gallai multigraphs

This page was built for publication: Gallai colorings of non-complete graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q966033)