Local Anti-Ramsey Numbers of Graphs

DOI10.1017/S0963548303005868MaRDI QIDQ4655896zbMATH OpenFDO

Authors Tao Jiang, Zsolt Tuza, Maria Axenovich

Publication date 8 March 2005

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0963548303005868

zbMATH Keywords

rainbowedge colouring

Mathematics Subject Classification ID

Paths and cycles (05C38) Generalized Ramsey theory (05C55)

Recommendations

• Local Ramsey numbers for some graphs
• Locally Ramsey properties of graphs
• Local and Mean Ramsey Numbers for Some Graphs
• Ramsey numbers for local colorings
• Local Ramsey numbers for copies of cycles
• Local Ramsey numbers for copies of cycles
• Local and meank-Ramsey numbers for complete graphs
• On local antimagic chromatic number of graphs
• Anti-Ramsey numbers of minimal graphs
• On modulo local antimagic chromatic number of graphs

Cited in

(22)

• Balanced edge-colorings avoiding rainbow cliques of size four
• On odd rainbow cycles in edge-colored graphs
• Sufficient conditions for properly colored \(C_3\)'s and \(C_4\)'s in edge-colored complete graphs
• Anti-Ramsey numbers of subdivided graphs
• Locally Ramsey properties of graphs
• Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
• Rainbow generalizations of Ramsey theory: A survey
• Local Ramsey numbers for copies of cycles
• Local edge colorings that are global
• Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints
• On locally rainbow colourings
• Properly colored and rainbow C4 ${C}_{4}$'s in edge‐colored graphs
• Local Ramsey numbers for some graphs
• Color degree condition for long rainbow paths in edge-colored graphs
• Extensions of Gallai-Ramsey results
• Rainbow subgraphs in edge‐colored complete graphs: Answering two questions by Erdős and Tuza
• Canonical Ramsey numbers and properly colored cycles
• Long rainbow paths and rainbow cycles in edge colored graphs. A survey
• Edge‐colored complete graphs without properly colored even cycles: A full characterization
• Properly colored cycles of different lengths in edge-colored complete graphs
• On colorings avoiding a rainbow cycle and a fixed monochromatic subgraph
• Disjoint properly colored cycles in edge-colored complete bipartite graphs

This page was built for publication: Local Anti-Ramsey Numbers of Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4655896)