Anti-Ramsey numbers for matchings in 3-regular bipartite graphs
From MaRDI portal
Publication:1732824
DOI10.1016/J.AMC.2016.07.037zbMath1410.05147OpenAlexW2506699369MaRDI QIDQ1732824
Publication date: 25 March 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2016.07.037
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Related Items (11)
Improved bounds for rainbow numbers of matchings in plane triangulations ⋮ Anti-Ramsey numbers for cycles in the generalized Petersen graphs ⋮ Rainbow matchings in an edge-colored planar bipartite graph ⋮ Rainbow number of matchings in planar graphs ⋮ Extremal coloring for the anti-Ramsey problem of matchings in complete graphs ⋮ Anti-Ramsey numbers for matchings in regular bipartite graphs ⋮ Anti-Ramsey number of matchings in outerplanar graphs ⋮ Anti-Ramsey number of matchings in a hypergraph ⋮ Rainbow matchings in edge-colored complete split graphs ⋮ Rainbow triangles in edge-colored Kneser graphs ⋮ On rainbow matchings in plane triangulations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rainbow numbers for matchings in plane triangulations
- Rainbow generalizations of Ramsey theory: A survey
- The rainbow number of matchings in regular bipartite graphs
- The anti-Ramsey number of perfect matching
- 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
- Edge-colorings of complete graphs that avoid polychromatic trees
- Edge-colorings with no large polychromatic stars
- Anti-Ramsey numbers of subdivided graphs
- Rainbow numbers for matchings and complete graphs
- Anti-Ramsey numbers for graphs with independent cycles
- 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
- An anti-Ramsey theorem
- Rainbow cliques in edge-colored graphs
This page was built for publication: Anti-Ramsey numbers for matchings in 3-regular bipartite graphs
