An anti-Ramsey theorem on cycles
From MaRDI portal
Publication:2573806
DOI10.1007/s00373-005-0619-yzbMath1075.05058MaRDI 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
Rainbow Numbers for Cycles in Plane Triangulations, Anti-Ramsey numbers for matchings in regular bipartite graphs, 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 coloring for matchings in complete bipartite graphs, Avoiding rainbow 2-connected subgraphs, Rainbow generalizations of Ramsey theory: A survey, An anti-Ramsey theorem on diamonds, The rainbow number of matchings in regular bipartite graphs, Rainbow numbers for graphs containing small cycles, Edge-colorings avoiding rainbow and monochromatic subgraphs, Rainbow numbers for cycles with pendant edges, Bipartite rainbow numbers of matchings, Complete solution for the rainbow numbers of matchings, Coloring the cube with rainbow cycles, Anti-Ramsey Problems for t Edge-Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or Trees, Totally Multicolored diamonds, Anti-Ramsey numbers of doubly edge-critical graphs
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
