Bipartite anti-Ramsey numbers of cycles
From MaRDI portal
Publication:3156920
DOI10.1002/jgt.20012zbMath1062.05095OpenAlexW2599363141MaRDI QIDQ3156920
André Kündgen, Tao Jiang, Maria A. Axenovich
Publication date: 12 January 2005
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20012
Related Items (33)
Improved bounds for rainbow numbers of matchings in plane triangulations ⋮ Anti-Ramsey numbers in complete split graphs ⋮ Anti-Ramsey number of Hanoi graphs ⋮ Improved approximation for maximum edge colouring problem ⋮ Rainbow number of matchings in planar graphs ⋮ 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 ⋮ Rainbows in the hypercube ⋮ 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 number of matchings in outerplanar graphs ⋮ Properly colored and rainbow C4 ${C}_{4}$'s in edge‐colored 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 matchings in edge-colored complete split graphs ⋮ Anti-Ramsey problems for cycles ⋮ Anti-Ramsey coloring for matchings in complete bipartite graphs ⋮ Avoiding rainbow 2-connected subgraphs ⋮ Anti-Ramsey numbers in complete \(k\)-partite graphs ⋮ Rainbow triangles in edge-colored Kneser graphs ⋮ Rainbow numbers for small graphs in planar graphs ⋮ The rainbow number of matchings in regular bipartite graphs ⋮ Worm colorings ⋮ Anti-Ramsey number of triangles in complete multipartite graphs ⋮ Complexity of Computing the Anti-Ramsey Numbers for Paths. ⋮ Bipartite rainbow numbers of matchings ⋮ Planar anti-Ramsey numbers of paths and cycles ⋮ 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
Cites Work
- Unnamed Item
- Edge-colorings of complete graphs that avoid polychromatic trees
- Edge-colorings with no large polychromatic stars
- On restricted edge-colorings of bicliques
- On the Erdős–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle
- An anti-Ramsey theorem
- On a generalized anti-Ramsey problem
This page was built for publication: Bipartite anti-Ramsey numbers of cycles
