Gallai colorings of non-complete graphs
From MaRDI portal
Publication:966033
DOI10.1016/j.disc.2009.10.013zbMath1230.05128MaRDI QIDQ966033
Gábor N. Sárközy, András Gyárfás
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
05C15: Coloring of graphs and hypergraphs
Related Items
Gallai colorings and domination in multipartite digraphs, Connected colourings of complete graphs and hypergraphs, Partitioning 2-edge-colored graphs by monochromatic paths and cycles, The Erdős-Hajnal conjecture for rainbow triangles
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 t2/log t
- Transitiv orientierbare Graphen
- Graph pairs and their entropies: Modularity problems