Anti-Ramsey problems in the Mycielskian of a cycle
From MaRDI portal
Publication:6048647
DOI10.1016/j.amc.2023.128267MaRDI QIDQ6048647
Yibo Li, Wenjie Hu, Xiaolan Hu, Huiqing Liu
Publication date: 11 October 2023
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Complete solution for the rainbow numbers of matchings
- Circular chromatic numbers of Mycielski's graphs
- Circular chromatic number and a generalization of the construction of Mycielski.
- Edge-colorings of complete graphs that avoid polychromatic trees
- Edge-colorings with no large polychromatic stars
- Rainbow matchings in edge-colored complete split graphs
- Improved bounds for anti-Ramsey numbers of matchings in outer-planar graphs
- Anti-Ramsey numbers for cycles in \(n\)-prisms
- Anti-Ramsey numbers for vertex-disjoint triangles
- Anti-Ramsey numbers for cycles in the generalized Petersen graphs
- Anti-Ramsey problems for cycles
- Planar anti-Ramsey numbers of paths and cycles
- Anti-Ramsey numbers for trees in complete multi-partite graphs
- An Automatic Method of Solving Discrete Programming Problems
- Circular chromatic number and Mycielski construction
- An anti-Ramsey theorem
This page was built for publication: Anti-Ramsey problems in the Mycielskian of a cycle
