Rainbow number of matchings in planar graphs
From MaRDI portal
Publication:1660271
DOI10.1016/J.DISC.2018.06.044zbMath1393.05116OpenAlexW2883613182WikidataQ129518617 ScholiaQ129518617MaRDI QIDQ1660271
Publication date: 15 August 2018
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2018.06.044
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 (10)
Improved bounds for rainbow numbers of matchings in plane triangulations ⋮ Rainbow matchings in an edge-colored planar bipartite graph ⋮ Exact rainbow numbers for matchings in plane triangulations ⋮ Anti-Ramsey number of matchings in outerplanar graphs ⋮ Anti-Ramsey number of matchings in a hypergraph ⋮ Rainbow numbers for paths in planar graphs ⋮ Rainbow triangles in edge-colored Kneser graphs ⋮ Rainbow numbers for small graphs in planar graphs ⋮ Improved bounds for anti-Ramsey numbers of matchings in outer-planar graphs ⋮ On rainbow matchings in plane triangulations
Cites Work
- Anti-Ramsey number of matchings in hypergraphs
- Rainbow numbers for matchings in plane triangulations
- Anti-Ramsey coloring for matchings in complete bipartite graphs
- Rainbow generalizations of Ramsey theory: A survey
- The rainbow number of matchings in regular bipartite graphs
- On restricted colourings of \(K_ n\)
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- Bipartite rainbow numbers of matchings
- Complete solution for the rainbow numbers of matchings
- Matching theory
- Extremal coloring for the anti-Ramsey problem of matchings in complete graphs
- Anti-Ramsey numbers for matchings in 3-regular bipartite graphs
- Rainbow matchings in edge-colored complete split graphs
- Rainbow numbers for matchings and complete graphs
- An anti-Ramsey theorem on 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
- Anti-Ramsey numbers for matchings in regular bipartite graphs
- An anti-Ramsey theorem
This page was built for publication: Rainbow number of matchings in planar graphs
