scientific article; zbMATH DE number 3494450
From MaRDI portal
Publication:4075490
Recommendations
Cited in
(only showing first 100 items - show all)- Bipartite rainbow numbers of matchings
- Complete solution for the rainbow numbers of matchings
- Complete graphs without polychromatic circuits
- Extremal problems concerning transformations of the set of edges of the complete graph
- Path and cycle sub-Ramsey numbers and an edge-colouring conjecture
- More star sub-Ramsey numbers
- Improved bounds for rainbow numbers of matchings in plane triangulations
- \((k,\lambda)\)-anti-powers and other patterns in words
- Anti-Ramsey number of Hanoi graphs
- Some heterochromatic theorems for matroids
- Extremal coloring for the anti-Ramsey problem of matchings in complete graphs
- Anti-powers in infinite words
- Monochromatic subgraphs in the absence of a properly colored 4-cycle
- On Erdős-Rado numbers
- Anti-Ramsey colorings in several rounds
- Anti-Ramsey numbers of subdivided graphs
- Rainbow numbers for matchings and complete graphs
- Multicolored subsets in colored hypergraphs
- Coloring the cube with rainbow cycles
- The anti-Ramsey numbers of \(C_3\) and \(C_4\) in complete \(r\)-partite graphs
- A large number of \(m\)-coloured complete infinite subgraphs
- Properly colored \(C_4\)'s in edge-colored graphs
- On the anti-Ramsey numbers of linear forests
- Anti-Ramsey numbers in complete k-partite graphs
- Rainbow triangles and cliques in edge-colored graphs
- Rainbow connection and graph products
- Anti-Ramsey number of triangles in complete multipartite graphs
- On the maximal colorings of complete graphs without some small properly colored subgraphs
- Improved bounds for anti-Ramsey numbers of matchings in outer-planar graphs
- Anti-Ramsey number of matchings in \(r\)-partite \(r\)-uniform hypergraphs
- Anti-Ramsey numbers for cycles in \(n\)-prisms
- Anti-Ramsey numbers for vertex-disjoint triangles
- Sufficient conditions for properly colored \(C_3\)'s and \(C_4\)'s in edge-colored complete graphs
- Anti-Ramsey numbers for cycles in the generalized Petersen graphs
- Anti-van der Waerden numbers on graphs
- An anti-Ramsey theorem of \(k\)-restricted edge-cuts
- Improved approximation for maximum edge colouring problem
- Rainbow matchings in an edge-colored planar bipartite graph
- Anti-Ramsey number of matchings in a hypergraph
- Rainbow numbers for paths in planar graphs
- Anti-Ramsey problems for cycles
- A note on the monotonicity of mixed Ramsey numbers
- Rainbow numbers for small graphs in planar graphs
- Planar anti-Ramsey numbers of paths and cycles
- On rainbow matchings in plane triangulations
- Anti-Ramsey problems in complete bipartite graphs for t edge-disjoint rainbow spanning subgraphs: cycles and matchings
- Facial rainbow edge-coloring of plane graphs
- On sufficient conditions for rainbow cycles in edge-colored graphs
- Planar anti-Ramsey numbers of matchings
- On the balanced upper chromatic number of cyclic projective planes and projective spaces
- An anti-Ramsey theorem on cycles
- Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning trees
- On the anti-Ramsey number of forests
- Exact rainbow numbers for matchings in plane triangulations
- On odd rainbow cycles in edge-colored graphs
- Complete edge-colored permutation graphs
- Anti-Ramsey numbers in complete split graphs
- Rainbow-free 3-colorings in abelian groups
- scientific article; zbMATH DE number 426321 (Why is no real title available?)
- Rainbow numbers for certain graphs
- Totally Multicolored diamonds
- Approximation and hardness results for the maximum edge q-coloring problem
- Anti-Ramsey numbers of spanning double stars
- scientific article; zbMATH DE number 3948323 (Why is no real title available?)
- Anti-Ramsey number of matchings in hypergraphs
- Rainbow numbers for matchings in plane triangulations
- Exactly m-coloured complete infinite subgraphs
- scientific article; zbMATH DE number 3536122 (Why is no real title available?)
- On the Erdős–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle
- Anti-Ramsey numbers for disjoint copies of graphs
- scientific article; zbMATH DE number 7377981 (Why is no real title available?)
- Subgraphs of Gallai-colored complete graphs spanned by edges using at most two colors
- Anti-Ramsey hypergraph numbers
- Complexity of Computing the Anti-Ramsey Numbers for Paths.
- Constructive Methods in Gallai-Ramsey Theory for Hypergraphs
- Color isomorphic even cycles and a related Ramsey problem
- Anti-Ramsey coloring for matchings in complete bipartite graphs
- Anti-Ramsey number of edge-disjoint rainbow spanning trees
- \((g,f)\)-chromatic spanning trees and forests
- Anti-Ramsey numbers of paths and cycles in hypergraphs
- Transversals in generalized Latin squares
- Anti-Ramsey numbers for matchings in regular bipartite graphs
- Anti-Ramsey Multiplicities
- An anti-Ramsey Theorem on edge-cutsets
- An anti-Ramsey theorem
- An anti-Ramsey theorem
- On a generalized anti-Ramsey problem
- Rainbow cliques in edge-colored graphs
- An anti-Ramsey theorem on diamonds
- Anti‐Ramsey number of expansions of paths and cycles in uniform hypergraphs
- Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs
- Anti-Ramsey problems in the Mycielskian of a cycle
- Constrained Ramsey numbers for the loose path, cycle and star
- Rainbow subgraphs in edge-colored planar and outerplanar graphs
- The Erdős–Gyárfás function with respect to Gallai‐colorings
- Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees in All Graphs
- Computing the anti-Ramsey number for trees in complete tripartite graph
- Turán numbers and anti-Ramsey numbers for short cycles in complete 3-partite graphs
- Properly colored and rainbow C4 ${C}_{4}$'s in edge‐colored graphs
- Anti-Ramsey number of disjoint union of star-like hypergraphs
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)