scientific article; zbMATH DE number 3494450
From MaRDI portal
Publication:4075490
Recommendations
Cited in
(only showing first 100 items - show all)- Coloring the cube with rainbow cycles
- Complete edge-colored permutation graphs
- Approximation and hardness results for the maximum edge q-coloring problem
- An anti-Ramsey theorem
- Size and degree anti-Ramsey numbers
- Anti-Ramsey colorings in several rounds
- On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems
- Complete graphs without polychromatic circuits
- Rainbow numbers for the generalized Schur equation \(x_1+x_2+\cdots+x_{m-1}=x_m\)
- Anti-Ramsey numbers for vertex-disjoint triangles in complete split graphs
- An anti-Ramsey theorem on cycles
- A partial edge-density version of the Corrádi-Hajnal theorem in hypergraphs
- Anti-Ramsey number of union of 5-path and matching
- Anti‐Ramsey number of expansions of paths and cycles in uniform hypergraphs
- Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees in All Graphs
- Turán numbers and anti-Ramsey numbers for short cycles in complete 3-partite graphs
- Exact rainbow numbers of cycle-related graphs in multi-hubbed wheels
- Rainbow short linear forests in edge-colored complete graph
- Not complementary connected and not CIS d-graphs form weakly monotone families
- Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
- The rainbow number of cycles in maximal outerplanar graphs
- Anti-Ramsey number of the star and matching family
- Improved bounds for anti-Ramsey numbers of matchings in outer-planar graphs
- Anti-Ramsey number of matchings in \(r\)-partite \(r\)-uniform hypergraphs
- Parameterized algorithms and hardness for the maximum edge q-coloring problem
- On the anti-Ramsey numbers of linear forests
- Weakened Gallai-Ramsey number for various graphs of order up to six
- scientific article; zbMATH DE number 3948323 (Why is no real title available?)
- Anti-Ramsey numbers for cycles in \(n\)-prisms
- Anti-Ramsey coloring for matchings in complete bipartite graphs
- Rainbow independent triangles in complete split graphs
- Anti-Ramsey numbers for disjoint copies of graphs
- Monochromatic graph decompositions inspired by anti-Ramsey colorings
- Circumference, minimum degree and clique number
- Rainbow subgraphs in edge-colored planar and outerplanar graphs
- Anti-Ramsey numbers for cycles in the generalized Petersen graphs
- Anti-Ramsey numbers of loose paths and cycles in uniform hypergraphs
- Anti-Ramsey hypergraph numbers
- The rainbow number of matchings in regular bipartite graphs
- Anti-Ramsey number for perfect matchings in 3-regular bipartite graphs
- Rainbow-free 3-colorings in abelian groups
- Transitive and Gallai colorings of the complete graph
- Rainbow forest consisting of short paths in K_n
- Rainbow connection and graph products
- Exact rainbow numbers for matchings in plane triangulations
- The anti-Ramsey numbers of \(C_3\) and \(C_4\) in complete \(r\)-partite graphs
- Anti-Ramsey number of matchings in a hypergraph
- Anti-Ramsey numbers of paths and cycles in hypergraphs
- Constructive Methods in Gallai-Ramsey Theory for Hypergraphs
- On sufficient conditions for rainbow cycles in edge-colored graphs
- Anti-Ramsey number of matchings in hypergraphs
- Approximating maximum edge 2-coloring by normalizing graphs
- Planar anti-Ramsey numbers of matchings
- A large number of \(m\)-coloured complete infinite subgraphs
- Complexity of Computing the Anti-Ramsey Numbers for Paths.
- The Erdős–Gyárfás function with respect to Gallai‐colorings
- A stability result of the Pósa lemma
- On odd rainbow cycles in edge-colored graphs
- Exactly m-coloured complete infinite subgraphs
- Subgraphs of Gallai-colored complete graphs spanned by edges using at most two colors
- Anti-Ramsey numbers of cycles of length three in uniform hypergraphs
- Rainbow numbers for certain graphs
- On the maximal colorings of complete graphs without some small properly colored subgraphs
- Color isomorphic even cycles and a related Ramsey problem
- Some heterochromatic theorems for matroids
- On the Erdős–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle
- An anti-Ramsey theorem
- Sufficient conditions for properly colored \(C_3\)'s and \(C_4\)'s in edge-colored complete graphs
- The rainbow numbers of paths in maximal bipartite planar graphs
- On the anti-Ramsey number of forests
- Complete solution for the rainbow numbers of matchings
- Local rainbow colorings for various graphs
- Anti-Ramsey numbers of subdivided graphs
- Properly colored \(C_4\)'s in edge-colored graphs
- Anti-Ramsey properties of random graphs
- Approximating maximum edge 2-coloring by normalizing graphs
- An explicit construction for a Ramsey problem
- Complexity of computing the anti-Ramsey numbers for paths
- Rainbow disjoint union of clique and matching in edge-colored complete graph
- Anti-Ramsey numbers in complete split graphs
- On the balanced upper chromatic number of cyclic projective planes and projective spaces
- Improved bounds for rainbow numbers of matchings in plane triangulations
- Rainbow transitive triangles in arc-colored digraphs
- Rainbow numbers for matchings in plane triangulations
- Anti-Ramsey numbers in complete k-partite graphs
- Rainbow triangles and cliques in edge-colored graphs
- Note on the anti-Ramsey number for matching in hypercubes
- The rainbow numbers of cycles in maximal bipartite planar graph
- Rainbow disjoint union of \(P_4\) and a matching in complete graphs
- Path and cycle sub-Ramsey numbers and an edge-colouring conjecture
- Planar anti-Ramsey numbers of paths and cycles
- \((k,\lambda)\)-anti-powers and other patterns in words
- Anti-Ramsey number of Hanoi graphs
- Rainbow numbers for paths in planar graphs
- Facial rainbow edge-coloring of plane graphs
- Monochromatic subgraphs in the absence of a properly colored 4-cycle
- Anti-powers in infinite words
- Rainbow numbers for small graphs in planar graphs
- Computing the anti-Ramsey number for trees in complete tripartite graph
- The anti-Ramsey number of perfect matching
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4075490)
