On rainbow matchings in plane triangulations
From MaRDI portal
Publication:2329209
DOI10.1016/j.disc.2019.111624zbMath1422.05043OpenAlexW2966566359MaRDI QIDQ2329209
Publication date: 17 October 2019
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2019.111624
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)
Related Items (2)
Rainbow matchings in an edge-colored planar bipartite graph ⋮ Exact rainbow numbers for matchings in plane triangulations
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
- 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
- Anti-Ramsey numbers for matchings in 3-regular bipartite graphs
- Anti-Ramsey numbers of subdivided graphs
- Rainbow numbers for matchings and complete graphs
- Planar anti-Ramsey numbers of paths and cycles
- Anti-Ramsey numbers for graphs with independent cycles
- Bipartite anti-Ramsey numbers of cycles
- 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
- Rainbow Numbers for Cycles in Plane Triangulations
- An anti-Ramsey theorem
This page was built for publication: On rainbow matchings in plane triangulations