Improved bounds for anti-Ramsey numbers of matchings in outer-planar graphs

DOI10.1016/j.amc.2021.126843OpenAlexW3204750561MaRDI QIDQ2073118

Hua He, Yongxin Lan, Yifan Pei

Publication date: 27 January 2022

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2005.08169

zbMATH Keywords

matchinganti-Ramsey numberouter-planar graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items (1)

Anti-Ramsey problems in the Mycielskian of a cycle

Cites Work

• Unnamed Item
• Anti-Ramsey number of matchings in hypergraphs
• Rainbow generalizations of Ramsey theory: A survey
• Bipartite rainbow numbers of matchings
• Complete solution for the rainbow numbers of matchings
• Matching theory
• Rainbow number of matchings in planar graphs
• Rainbow matchings in edge-colored complete split graphs
• Rainbow numbers for matchings and complete graphs
• Planar anti-Ramsey numbers of paths and cycles
• Exact rainbow numbers for matchings in plane triangulations
• Rainbow Numbers for Cycles in Plane Triangulations
• Anti-Ramsey numbers for matchings in regular bipartite graphs

This page was built for publication: Improved bounds for anti-Ramsey numbers of matchings in outer-planar graphs