scientific article; zbMATH DE number 3494450
From MaRDI portal
Publication:4075490
Recommendations
Cited in
(only showing first 100 items - show all)- Mono-multi bipartite Ramsey numbers, designs, and matrices
- On the maximal colorings of complete graphs without some small properly colored subgraphs
- A note on the monotonicity of mixed Ramsey numbers
- Planar anti-Ramsey numbers of matchings
- Rainbow connection and graph products
- Rainbow cliques in edge-colored graphs
- Anti-Ramsey hypergraph numbers
- scientific article; zbMATH DE number 3536122 (Why is no real title available?)
- \((g,f)\)-chromatic spanning trees and forests
- Anti-Ramsey number of matchings in hypergraphs
- On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems
- Rainbow numbers for matchings in plane triangulations
- On a heterochromatic number for hypercubes
- The Erdős–Gyárfás function with respect to Gallai‐colorings
- Anti-powers in infinite words
- Edge-colorings avoiding rainbow and monochromatic subgraphs
- Constructive Methods in Gallai-Ramsey Theory for Hypergraphs
- On sufficient conditions for rainbow cycles in edge-colored graphs
- Anti-Ramsey numbers in complete split graphs
- Complete graphs without polychromatic circuits
- \((k,\lambda)\)-anti-powers and other patterns in words
- Anti-Ramsey number of Hanoi graphs
- Bipartite rainbow numbers of matchings
- Rainbow-free 3-colorings in abelian groups
- Extremal coloring for the anti-Ramsey problem of matchings in complete graphs
- More star sub-Ramsey numbers
- Planar anti-Ramsey numbers of paths and cycles
- Anti-Ramsey properties of random graphs
- Exactly \(m\)-coloured complete infinite subgraphs
- The rainbow number of matchings in regular bipartite graphs
- Improved bounds for rainbow numbers of matchings in plane triangulations
- Anti-Ramsey number of matchings in a hypergraph
- Approximation and hardness results for the maximum edge \(q\)-coloring problem
- Anti-Ramsey numbers for matchings in regular bipartite graphs
- Anti-Ramsey numbers of spanning double stars
- Rainbow numbers for certain graphs
- Path and cycle sub-Ramsey numbers and an edge-colouring conjecture
- Complete solution for the rainbow numbers of matchings
- Not complementary connected and not CIS \(d\)-graphs form weakly monotone families
- An anti-Ramsey theorem on diamonds
- An anti-Ramsey theorem on cycles
- Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
- Anti-Ramsey numbers of subdivided graphs
- An anti-Ramsey theorem
- On restricted colourings of \(K_ n\)
- On the Erdős–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle
- Facial rainbow edge-coloring of plane graphs
- scientific article; zbMATH DE number 426321 (Why is no real title available?)
- Anti-Ramsey Multiplicities
- Anti-Ramsey colorings in several rounds
- An anti-Ramsey Theorem on edge-cutsets
- An explicit construction for a Ramsey problem
- The anti-Ramsey number of perfect matching
- Some heterochromatic theorems for matroids
- On odd rainbow cycles in edge-colored graphs
- Rainbow numbers for matchings and complete graphs
- An anti-Ramsey theorem
- On the anti-Ramsey numbers of linear forests
- Size and degree anti-Ramsey numbers
- scientific article; zbMATH DE number 7377981 (Why is no real title available?)
- Anti-Ramsey coloring for matchings in complete bipartite graphs
- On Erdős-Rado numbers
- Rainbow matchings in an edge-colored planar bipartite graph
- Monochromatic subgraphs in the absence of a properly colored 4-cycle
- On a generalized anti-Ramsey problem
- Coloring the cube with rainbow cycles
- Extremal problems concerning transformations of the set of edges of the complete graph
- Monochromatic graph decompositions inspired by anti-Ramsey colorings
- Circumference, minimum degree and clique number
- Color isomorphic even cycles and a related Ramsey problem
- Anti-Ramsey numbers of paths and cycles in hypergraphs
- Turán numbers and anti-Ramsey numbers for short cycles in complete \(3\)-partite graphs
- An anti-Ramsey theorem of \(k\)-restricted edge-cuts
- Anti-van der Waerden numbers on graphs
- Rainbow numbers for small graphs in planar graphs
- A stability result of the Pósa lemma
- Improved approximation for maximum edge colouring problem
- Properly colored and rainbow C4 ${C}_{4}$'s in edge‐colored graphs
- On the balanced upper chromatic number of cyclic projective planes and projective spaces
- Anti-Ramsey number of triangles in complete multipartite graphs
- Properly colored \(C_4\)'s in edge-colored graphs
- Anti-Ramsey number of edge-disjoint rainbow spanning trees
- Rainbow short linear forests in edge-colored complete graph
- Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning trees
- Rainbow subgraphs in edge-colored planar and outerplanar graphs
- Exact rainbow numbers for matchings in plane triangulations
- Totally Multicolored diamonds
- Complexity of Computing the Anti-Ramsey Numbers for Paths.
- Anti-Ramsey numbers for disjoint copies of graphs
- Rainbow numbers for the generalized Schur equation \(x_1+x_2+\cdots+x_{m-1}=x_m\)
- The rainbow numbers of cycles in maximal bipartite planar graph
- Rainbow disjoint union of \(P_4\) and a matching in complete graphs
- A large number of \(m\)-coloured complete infinite subgraphs
- Anti-Ramsey numbers for cycles in \(n\)-prisms
- scientific article; zbMATH DE number 3948323 (Why is no real title available?)
- The anti-Ramsey numbers of \(C_3\) and \(C_4\) in complete \(r\)-partite graphs
- Approximating maximum edge 2-coloring by normalizing graphs
- Sufficient conditions for properly colored \(C_3\)'s and \(C_4\)'s in edge-colored complete graphs
- Anti-Ramsey problems for cycles
- Constrained Ramsey numbers for the loose path, cycle and star
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)