The rainbow number of matchings in regular bipartite graphs
From MaRDI portal
Publication:735110
DOI10.1016/J.AML.2009.03.019zbMath1171.05394arXiv0711.2846OpenAlexW2591829030MaRDI QIDQ735110
Publication date: 14 October 2009
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0711.2846
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (13)
Rainbow matchings in an edge-colored planar bipartite graph ⋮ Rainbow number of matchings in planar graphs ⋮ Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning trees ⋮ 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 numbers for matchings in 3-regular bipartite graphs ⋮ Anti-Ramsey number of matchings in a hypergraph ⋮ Rainbow matchings in edge-colored complete split graphs ⋮ Anti-Ramsey coloring for matchings in complete bipartite graphs ⋮ Rainbow triangles in edge-colored Kneser graphs ⋮ Anti-Ramsey number of matchings in \(r\)-partite \(r\)-uniform hypergraphs ⋮ Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning subgraphs: cycles and matchings
Cites Work
- Unnamed Item
- Unnamed Item
- On restricted colourings of \(K_ n\)
- Bipartite rainbow numbers of matchings
- Complete solution for the rainbow numbers of matchings
- 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
This page was built for publication: The rainbow number of matchings in regular bipartite graphs
