Anti-Ramsey numbers for graphs with independent cycles

zbMath1186.05052MaRDI QIDQ2380240

Ze-min Jin, Xue Liang Li

Publication date: 26 March 2010

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/227017

zbMATH Keywords

anti Ramsey numberrainbow graphstwo independent cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items (19)

Improved bounds for rainbow numbers of matchings in plane triangulations ⋮ Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning trees ⋮ Exact rainbow numbers for matchings in plane triangulations ⋮ Rainbow generalizations of Ramsey theory: A survey ⋮ Extremal coloring for the anti-Ramsey problem of matchings in complete graphs ⋮ Anti-Ramsey numbers for matchings in regular bipartite graphs ⋮ Planar anti-Ramsey numbers of matchings ⋮ 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 problems for cycles ⋮ Anti-Ramsey coloring for matchings in complete bipartite graphs ⋮ Anti-Ramsey numbers in complete \(k\)-partite graphs ⋮ Rainbow numbers for small graphs in planar graphs ⋮ Anti-Ramsey number of triangles in complete multipartite graphs ⋮ 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

This page was built for publication: Anti-Ramsey numbers for graphs with independent cycles