Rainbow numbers for matchings and complete graphs
From MaRDI portal
Publication:1883265
DOI10.1016/j.disc.2003.11.057zbMath1053.05053OpenAlexW2033759535MaRDI QIDQ1883265
Publication date: 1 October 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2003.11.057
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)
Related Items (52)
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 ⋮ Anti-Ramsey Hypergraph Numbers ⋮ Improved approximation for maximum edge colouring problem ⋮ Rainbow matchings in an edge-colored planar bipartite graph ⋮ Rainbow number of matchings in planar graphs ⋮ On the anti-Ramsey number of forests ⋮ Exact rainbow numbers for matchings in plane triangulations ⋮ Rainbow generalizations of Ramsey theory: A survey ⋮ Rainbows in the hypercube ⋮ Rainbow \(C_3\)'s and \(C_4\)'s in edge-colored graphs ⋮ Extremal coloring for the anti-Ramsey problem of matchings in complete graphs ⋮ Anti-Ramsey number of matchings in hypergraphs ⋮ Anti-Ramsey numbers for matchings in regular bipartite graphs ⋮ Rainbow numbers for matchings in plane triangulations ⋮ Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs ⋮ Planar anti-Ramsey numbers of matchings ⋮ Rainbow numbers for graphs containing small cycles ⋮ 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 ⋮ 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 coloring for matchings in complete bipartite graphs ⋮ Properly colored \(C_4\)'s in edge-colored graphs ⋮ On the anti-Ramsey numbers of linear forests ⋮ Rainbow triangles and cliques in edge-colored graphs ⋮ A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph ⋮ Anti-Ramsey numbers for disjoint copies of graphs ⋮ Rainbow triangles in edge-colored Kneser graphs ⋮ Rainbow numbers for small graphs in planar graphs ⋮ Rainbow cliques in edge-colored graphs ⋮ The rainbow number of matchings in regular bipartite graphs ⋮ Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs ⋮ Anti-Ramsey Problems for t Edge-Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or Trees ⋮ Rainbow numbers for cycles with pendant edges ⋮ On the maximal colorings of complete graphs without some small properly colored subgraphs ⋮ Complexity of Computing the Anti-Ramsey Numbers for Paths. ⋮ Bipartite rainbow numbers of matchings ⋮ Complete solution for the rainbow numbers of matchings ⋮ Improved bounds for anti-Ramsey numbers of matchings in outer-planar graphs ⋮ Anti-Ramsey numbers of doubly edge-critical graphs ⋮ Rainbow faces in edge‐colored plane graphs ⋮ Anti-Ramsey number of matchings in \(r\)-partite \(r\)-uniform hypergraphs ⋮ Planar anti-Ramsey numbers of paths and cycles ⋮ 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 ⋮ Rainbow numbers for certain graphs
Cites Work
This page was built for publication: Rainbow numbers for matchings and complete graphs
