Some rainbow cycles in r-good edge-colorings
From MaRDI portal
Publication:2286079
Recommendations
Cites work
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Color degree and heterochromatic cycles in edge-colored graphs
- Constrained Ramsey numbers of graphs
- Existences of rainbow matchings and rainbow matching covers
- Large rainbow matchings in edge-coloured graphs
- Local k-colorings of graphs and hypergraphs
- Long rainbow cycles in proper edge-colorings of complete graphs
- Long rainbow paths and rainbow cycles in edge colored graphs. A survey
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- On rainbow cycles in edge colored complete graphs
- Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints
- Rainbow \(C_3\)'s and \(C_4\)'s in edge-colored graphs
- Rainbow matching in edge-colored graphs
- Rainbow matchings in properly edge colored graphs
- Rainbow Turán problem for even cycles
- Rainbow Turán Problems
- Ramsey numbers for local colorings
- Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles
Cited in
(5)
This page was built for publication: Some rainbow cycles in \(r\)-good edge-colorings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2286079)