Planar anti-Ramsey numbers of matchings
From MaRDI portal
Publication:2421877
DOI10.1016/j.disc.2019.04.005zbMath1414.05189arXiv1803.04889OpenAlexW2963460849WikidataQ127934314 ScholiaQ127934314MaRDI QIDQ2421877
Zi-Xia Song, Yongxin Lan, Gang Chen
Publication date: 18 June 2019
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.04889
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (8)
Anti-Ramsey numbers for cycles in the generalized Petersen graphs ⋮ Rainbow matchings in an edge-colored planar bipartite graph ⋮ Exact rainbow numbers for matchings in plane triangulations ⋮ Generalized planar Turán numbers ⋮ Anti-Ramsey number of matchings in outerplanar graphs ⋮ Anti-Ramsey number of matchings in a hypergraph ⋮ The anti-Ramsey numbers of \(C_3\) and \(C_4\) in complete \(r\)-partite graphs ⋮ Rainbow numbers for small graphs in planar graphs
Cites Work
- Unnamed Item
- Rainbow numbers for matchings in plane triangulations
- Maximum face-constrained coloring of plane graphs
- Improved bounds for rainbow numbers of matchings in plane triangulations
- Anti-Ramsey numbers of subdivided graphs
- Rainbow numbers for matchings and complete graphs
- Anti-Ramsey numbers for graphs with independent cycles
- ExtremalC4-Free/C5-Free Planar Graphs
- Bipartite anti-Ramsey numbers of cycles
- Non-rainbow colorings of 3-, 4- and 5-connected plane graphs
- Anti-Ramsey numbers of doubly edge-critical graphs
- Rainbow faces in edge‐colored plane graphs
- On a conjecture of erdöus, simonovits, and sós concerning anti‐Ramsey theorems
- HYPERGRAPHS
- Rainbow Numbers for Cycles in Plane Triangulations
- An anti-Ramsey theorem
This page was built for publication: Planar anti-Ramsey numbers of matchings
