The anti-Ramsey number of perfect matching
From MaRDI portal
Publication:764878
DOI10.1016/j.disc.2011.10.017zbMath1241.05031OpenAlexW2027060958MaRDI QIDQ764878
Publication date: 16 March 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.10.017
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (max. 100)
Improved bounds for rainbow numbers of matchings in plane triangulations ⋮ Anti-Ramsey numbers in complete split graphs ⋮ Anti-Ramsey numbers of graphs with small connected components ⋮ Anti-Ramsey number of Hanoi graphs ⋮ Improved approximation for maximum edge colouring problem ⋮ Rainbow matchings in an edge-colored planar bipartite graph ⋮ Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning trees ⋮ On the anti-Ramsey number of forests ⋮ Exact rainbow numbers for matchings in plane triangulations ⋮ Extremal coloring for the anti-Ramsey problem of matchings in complete graphs ⋮ Anti-Ramsey number of matchings in hypergraphs ⋮ Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs ⋮ Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees in All Graphs ⋮ Anti-Ramsey number of matchings in outerplanar graphs ⋮ Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees ⋮ Anti-Ramsey numbers for matchings in 3-regular bipartite 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 paths in planar graphs ⋮ Rainbow matchings in edge-colored complete split graphs ⋮ Anti-Ramsey problems for cycles ⋮ Anti-Ramsey numbers in complete \(k\)-partite graphs ⋮ Anti-Ramsey numbers for disjoint copies of graphs ⋮ Rainbow triangles in edge-colored Kneser graphs ⋮ Rainbow numbers for small graphs in planar graphs ⋮ On heterochromatic out-directed spanning trees in tournaments ⋮ Anti-Ramsey Problems for t Edge-Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or Trees ⋮ Complexity of Computing the Anti-Ramsey Numbers for Paths. ⋮ Anti-Ramsey numbers for cycles in \(n\)-prisms ⋮ On rainbow matchings in plane triangulations ⋮ Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning subgraphs: cycles and matchings ⋮ Anti-Ramsey numbers for vertex-disjoint triangles
Cites Work
This page was built for publication: The anti-Ramsey number of perfect matching
