Rainbow numbers for paths in planar graphs
From MaRDI portal
Publication:2242061
DOI10.1016/j.amc.2020.125918OpenAlexW3119348727MaRDI QIDQ2242061
Zhongmei Qin, Shasha Li, Yongxin Lan, Jun Yue
Publication date: 9 November 2021
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2020.125918
Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)
Cites Work
- Unnamed Item
- Unnamed Item
- Anti-Ramsey number of matchings in hypergraphs
- Rainbow numbers for matchings in plane triangulations
- Rainbow generalizations of Ramsey theory: A survey
- The anti-Ramsey number of perfect matching
- Connected graphs without long paths
- Bipartite rainbow numbers of matchings
- Complete solution for the rainbow numbers of matchings
- A rainbow \(k\)-matching in the complete graph with \(r\) colors
- Improved bounds for rainbow numbers of matchings in plane triangulations
- Rainbow number of matchings in planar graphs
- Extremal coloring for the anti-Ramsey problem of matchings in complete graphs
- Degree powers in graphs with a forbidden forest
- Rainbow matchings in edge-colored complete split graphs
- Anti-Ramsey numbers of subdivided graphs
- Rainbow numbers for matchings and complete graphs
- Anti-Ramsey problems for cycles
- Rainbow numbers for small graphs in planar graphs
- Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
- Planar anti-Ramsey numbers of paths and cycles
- Extremal Theta-free planar graphs
- Planar Turán numbers of short paths
- Extremal \(H\)-free planar graphs
- On a conjecture of erdöus, simonovits, and sós concerning anti‐Ramsey theorems
- Rainbow Numbers for Cycles in Plane Triangulations
- Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs
- An anti-Ramsey theorem
This page was built for publication: Rainbow numbers for paths in planar graphs
