Anti-Ramsey numbers for disjoint copies of graphs
From MaRDI portal
(Redirected from Publication:4690986)
Recommendations
Cites work
- A rainbow \(k\)-matching in the complete graph with \(r\) colors
- An anti-Ramsey theorem on cycles
- Anti-Ramsey numbers of graphs with small connected components
- Anti-Ramsey numbers of small graphs.
- Arc coverings of graphs
- Edge-colorings of complete graphs that avoid polychromatic trees
- Edge-colorings with no large polychromatic stars
- scientific article; zbMATH DE number 3494450 (Why is no real title available?)
- scientific article; zbMATH DE number 3285073 (Why is no real title available?)
- On a conjecture of erdöus, simonovits, and sós concerning anti‐Ramsey theorems
- On the Erdős–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle
- On totally multicolored stars
- Rainbow generalizations of Ramsey theory: A survey
- Rainbow numbers for cycles with pendant edges
- Rainbow numbers for graphs containing small cycles
- Rainbow numbers for matchings and complete graphs
- The anti-Ramsey number of perfect matching
- Totally Multicolored diamonds
Cited in
(8)- Anti-Ramsey numbers for cycles in \(n\)-prisms
- Anti-Ramsey numbers for vertex-disjoint triangles
- Anti-Ramsey numbers for graphs with independent cycles
- On the anti-Ramsey number of forests
- Anti-Ramsey numbers of graphs with small connected components
- Anti-Ramsey numbers of doubly edge-critical graphs
- scientific article; zbMATH DE number 867688 (Why is no real title available?)
- Rainbow disjoint union of \(P_4\) and a matching in complete graphs
This page was built for publication: Anti-Ramsey numbers for disjoint copies of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4690986)
