Gallai colorings of non-complete graphs
From MaRDI portal
Publication:966033
DOI10.1016/J.DISC.2009.10.013zbMATH Open1230.05128OpenAlexW1979911458MaRDI QIDQ966033FDOQ966033
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
Recommendations
Cites Work
- Title not available (Why is that?)
- The Ramsey number R(3, t) has order of magnitude t2/log t
- Transitiv orientierbare Graphen
- Ramsey-type results for Gallai colorings
- Edge colorings of complete graphs without tricolored triangles
- A note on perfect graphs
- Maximum degree and fractional matchings in uniform hypergraphs
- A translation of Gallai's paper: `Transitiv orientierbare Graphen'
- Large monochromatic components in edge colorings of graphs: A survey
- Perfect couples of graphs
- Graph pairs and their entropies: Modularity problems
Cited In (23)
- A conjecture on Gallai-Ramsey numbers of even cycles and paths
- Gallai-colorings of triples and 2-factors of \(\mathcal{B}_3\)
- Edge-colored complete graphs containing no properly colored odd cycles
- Counting Gallai 3-colorings of complete graphs
- Gallai-Ramsey numbers of \(C_7\) 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
- Title not available (Why is that?)
- Edge colorings of complete graphs without tricolored triangles
- Gallai colorings and domination in multipartite digraphs
- Colored graphs without colorful cycles
- Disconnected colors in generalized Gallai-colorings
- The Typical Structure of Gallai Colorings and Their Extremal Graphs
- Complete edge-colored permutation graphs
- The number of Gallai \(k\)-colorings of complete 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)
