Edge colorings of complete graphs without tricolored triangles
From MaRDI portal
Publication:4474285
DOI10.1002/JGT.20001zbMATH Open1041.05028OpenAlexW2599261204MaRDI QIDQ4474285FDOQ4474285
Authors: András Gyárfás, Gábor Simonyi 
Publication date: 4 August 2004
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20001
Recommendations
Cites Work
Cited In (93)
- The Erdős–Gyárfás function with respect to Gallai‐colorings
- Distribution of colors in Gallai colorings
- A conjecture on Gallai-Ramsey numbers of even cycles and paths
- Subgraphs of Gallai-colored complete graphs spanned by edges using at most two colors
- Counting Gallai 3-colorings of complete graphs
- Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles
- Gallai and \(\ell \)-uniform Ramsey numbers of complete bipartite graphs
- Complete graphs and complete bipartite graphs without rainbow path
- Gallai-Ramsey numbers for graphs with chromatic number three
- Ramsey and Gallai-Ramsey numbers for the union of paths and stars
- Density of Gallai multigraphs
- Properly edge-colored theta graphs in edge-colored complete graphs
- Star-critical Gallai-Ramsey numbers of graphs
- Sufficient conditions for properly colored \(C_3\)'s and \(C_4\)'s in edge-colored complete graphs
- Gallai-Ramsey numbers for cycles
- The Erdős-Hajnal conjecture for rainbow triangles
- Monochromatic stars in rainbow \(K_3\)-free and \(S_3^+\)-free colorings
- Ramsey-type results for Gallai colorings
- Gallai-Ramsey numbers for a class of graphs with five vertices
- Gallai-Ramsey numbers for rainbow \(S_3^+\) and monochromatic paths
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- Gallai-Ramsey number of an 8-cycle
- Rainbow generalizations of Ramsey theory: A survey
- Gallai-Ramsey numbers for monochromatic triangles or 4-cycles
- Monochromatic subgraphs in the absence of a properly colored 4-cycle
- Gallai-Ramsey numbers involving a rainbow 4-path
- Vertex colorings without rainbow subgraphs
- Gallai-Ramsey numbers of odd cycles and complete bipartite graphs
- On the maximal triangle-free edge-chromatic graphs in three colors
- Gallai-Ramsey numbers for multiple triangles
- A note on the monotonicity of mixed Ramsey numbers
- Size of monochromatic double stars in edge colorings
- Gallai-Ramsey numbers for books
- A note on Gallai-Ramsey number of even wheels
- Arithmetic progressions, quasi progressions, and Gallai-Ramsey colorings
- Gallai colorings and domination in multipartite digraphs
- Colored graphs without colorful cycles
- Rainbow triangles in arc-colored tournaments
- Improved upper bounds for Gallai-Ramsey numbers of paths and cycles
- Disconnected colors in generalized Gallai-colorings
- The Typical Structure of Gallai Colorings and Their Extremal Graphs
- Extensions of Gallai-Ramsey results
- Highly connected monochromatic subgraphs
- Edge-colorings avoiding rainbow and monochromatic subgraphs
- The number of Gallai \(k\)-colorings of complete graphs
- Gallai-Ramsey numbers of \(C_{10}\) and \(C_{12}\)
- On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems
- Gallai-Ramsey number of even cycles with chords
- Remarks on the distribution of colors in Gallai colorings
- Connected colourings of complete graphs and hypergraphs
- Gallai colorings of non-complete graphs
- Not complementary connected and not CIS \(d\)-graphs form weakly monotone families
- Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
- Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles
- Minimally connected \(r\)-uniform hypergraphs
- Gallai-Ramsey number of odd cycles with chords
- Properly edge-coloured subgraphs in colourings of bounded degree
- A decomposition of Gallai multigraphs
- All partitions have small parts -- Gallai-Ramsey numbers of bipartite graphs
- Constructive Methods in Gallai-Ramsey Theory for Hypergraphs
- Extremal problems and results related to Gallai-colorings
- Properly colored cycles in edge-colored complete graphs without monochromatic triangle: a vertex-pancyclic analogous result
- Disproof of a conjecture on the rainbow triangles in arc-colored digraphs
- On sufficient conditions for rainbow cycles in edge-colored graphs
- Rainbow triangles in arc-colored digraphs
- Title not available (Why is that?)
- Complete bipartite graphs without small rainbow subgraphs
- Ramsey and Gallai-Ramsey number for wheels
- Ramsey and Gallai-Ramsey numbers for stars with extra independent edges
- Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic paths of length three
- Destroying Bicolored $P_3$s by Deleting Few Edges
- The Gallai-Ramsey number for a tree versus complete graphs
- Ramsey and Gallai-Ramsey numbers for two classes of unicyclic graphs
- A characterization of easily testable induced digraphs and \(k\)-colored graphs
- Minimum-degree conditions for rainbow triangles
- Gallai-Ramsey numbers for 3-uniform rainbow Berge triangles and monochromatic linear paths or cycles
- Properly colored and rainbow C4 ${C}_{4}$'s in edge‐colored graphs
- The multicolor star-critical Gallai-Ramsey number for a path of order 5
- Destroying the Ramsey property by the removal of edges
- Gallai-Ramsey numbers for graphs with five vertices and chromatic number four
- Gallai-Ramsey numbers for rainbow \(P_5\) and monochromatic fans or wheels
- Gallai-Ramsey numbers for paths
- Complete edge-colored permutation graphs
- Gallai-Ramsey number for the union of stars
- Complete bipartite graphs without small rainbow stars
- Proper rainbow-cycle-forbidding edge colorings of graphs
- Ramsey and Gallai-Ramsey numbers for comb and sun graphs
- Sandwich problem for \(\varPi\)- and \(\varDelta\)-free multigraphs and its applications to positional games
- Triangle edge deletion on planar glasses-free RGB-digraphs
- Gallai-Ramsey numbers for fans
- Star-critical Gallai-Ramsey numbers involving the disjoint union of triangles
- Size Gallai-Ramsey number
- Multicolor star-critical Ramsey numbers and Ramsey-good graphs
This page was built for publication: Edge colorings of complete graphs without tricolored triangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474285)
