Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints
From MaRDI portal
(Redirected from Publication:4446871)
Recommendations
Cited in
(45)- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- Canonical Ramsey numbers and properly colored cycles
- On the approximability of the minimum rainbow subgraph problem and other related problems
- Sparse hypergraphs with low independence number
- Rainbow Hamiltonian cycles in strongly edge-colored graphs
- Multicolor Turán numbers
- Better lower and upper bounds for the minimum rainbow subgraph problem
- Some rainbow cycles in \(r\)-good edge-colorings
- Bounded colorings of multipartite graphs and hypergraphs
- Bounds for bipartite rainbow Ramsey numbers
- Rainbow matchings: existence and counting
- Properly coloured copies and rainbow copies of large graphs with small maximum degree
- Bounds on edge colorings with restrictions on the union of color classes
- scientific article; zbMATH DE number 434896 (Why is no real title available?)
- On degree anti-Ramsey numbers
- Rainbow faces in edge-colored plane graphs
- Rainbow subgraphs in properly edge‐colored graphs
- On an anti-Ramsey threshold for random graphs
- How many colors guarantee a rainbow matching?
- Local edge colorings that are global
- Color degree and heterochromatic cycles in edge-colored graphs
- Anti-Ramsey theory on complete bipartite graphs
- Large Rainbow Cliques in Randomly Perturbed Dense Graphs
- Lower bounds for rainbow Turan numbers of paths and other trees
- Distinct volume subsets
- Large cliques in sparse random intersection graphs
- Extremal results for Berge hypergraphs
- Rainbow perfect matchings in complete bipartite graphs: existence and counting
- Rainbow decompositions
- Almost-Fisher families
- Constrained Ramsey Numbers
- Constrained Ramsey numbers
- Rainbow generalizations of Ramsey theory: A survey
- Graph Tilings in Incompatibility Systems
- Balanced edge-colorings avoiding rainbow cliques of size four
- Rainbow subgraphs in edge‐colored complete graphs: Answering two questions by Erdős and Tuza
- On multicolor Turán numbers
- Properly edge-coloured subgraphs in colourings of bounded degree
- On the rainbow planar Turán number of double stars
- On locally rainbow colourings
- Improved bounds for proper rainbow saturation
- Canonical Ramsey numbers of sparse graphs
- On the off-diagonal unordered Erdős-Rado numbers
- Canonical Ramsey numbers for partite hypergraphs
- Rainbow tetrahedra in Cayley graphs
This page was built for publication: Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4446871)
