Anti-Ramsey coloring for matchings in complete bipartite graphs
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-015-9926-2
Abstract: The anti-Ramsey number AR(G, H) is defined to be the maximum number of colors in an edge coloring of G which doesn’t contain any rainbow subgraphs isomorphic to H. It is clear that there is an… read more here.
Keywords: ramsey coloring; anti ramsey; anti; edge coloring ... See more keywords