An anti-Ramsey theorem on cycles
From MaRDI portal
Publication:2573806
DOI10.1007/s00373-005-0619-yzbMath1075.05058OpenAlexW2028312736MaRDI QIDQ2573806
Juan José Montellano-Ballesteros, Víctor Neumann-Lara
Publication date: 24 November 2005
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-005-0619-y
Related Items
Anti-Ramsey numbers in complete split graphs ⋮ Anti-Ramsey numbers of graphs with small connected components ⋮ Rainbow spanning subgraphs of small diameter in edge-colored complete graphs ⋮ Anti-Ramsey number of Hanoi graphs ⋮ Improved approximation for maximum edge colouring problem ⋮ Some heterochromatic theorems for matroids ⋮ Rainbow number of matchings in planar graphs ⋮ Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning trees ⋮ On the anti-Ramsey number of forests ⋮ On odd rainbow cycles in edge-colored graphs ⋮ Rainbow generalizations of Ramsey theory: A survey ⋮ An anti-Ramsey theorem on diamonds ⋮ Extremal coloring for the anti-Ramsey problem of matchings in complete graphs ⋮ Anti-Ramsey numbers for matchings in regular bipartite graphs ⋮ Totally Multicolored diamonds ⋮ Long rainbow paths and rainbow cycles in edge colored graphs. A survey ⋮ Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees in All Graphs ⋮ Rainbow numbers for graphs containing small cycles ⋮ Anti-Ramsey number of matchings in outerplanar graphs ⋮ New bounds on the anti-Ramsey numbers of star graphs via maximum edge \(q\)-coloring ⋮ Coloring the cube with rainbow cycles ⋮ 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 ⋮ Edge-colorings avoiding rainbow and monochromatic subgraphs ⋮ 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 ⋮ Properly colored \(C_4\)'s in edge-colored graphs ⋮ Anti-Ramsey numbers in complete \(k\)-partite graphs ⋮ Anti-Ramsey numbers for disjoint copies of graphs ⋮ Rainbow triangles in edge-colored Kneser graphs ⋮ The rainbow number of matchings in regular bipartite graphs ⋮ Anti-Ramsey number of triangles in complete multipartite 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 ⋮ Rainbow Numbers for Cycles in Plane Triangulations ⋮ Anti-Ramsey numbers of doubly edge-critical graphs ⋮ Anti-Ramsey number of matchings in \(r\)-partite \(r\)-uniform hypergraphs ⋮ Anti-Ramsey numbers for cycles in \(n\)-prisms ⋮ 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
- On restricted colourings of \(K_ n\)
- Panconnected graphs. II
- Smallest 3-graphs having a 3-colored edge in every k-coloring
- A linear heterochromatic number of graphs
- Minimal colorings for properly colored subgraphs
- Hamiltonian path graphs
- On the hamiltonian path graph of a graph
- On a conjecture of erdöus, simonovits, and sós concerning anti‐Ramsey theorems
- On the minimum size of tight hypergraphs
- Path connected graphs
- Sufficient Conditions for Circuits in Graphs†
- An anti-Ramsey theorem
