Rainbow numbers for graphs containing small cycles

DOI10.1007/S00373-015-1577-7MaRDI QIDQ897256zbMATH OpenOpenAlexFDO

Authors Ingo Schiermeyer, Roman Soták

Publication date 17 December 2015

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-015-1577-7

zbMATH Keywords

anti-Ramsey numberrainbow numberrainbow colouringTurán number

Mathematics Subject Classification ID

Distance in graphs (05C12) Paths and cycles (05C38) Generalized Ramsey theory (05C55)

Recommendations

• Rainbow numbers for cycles with pendant edges
• Rainbow numbers for small stars with one edge added
• Rainbow numbers for certain graphs
• Rainbow numbers for matchings and complete graphs
• Rainbow cycles versus rainbow paths

Cites work

• scientific article; zbMATH DE number 3041944 (Why is no real title available?)
• A rainbow \(k\)-matching in the complete graph with \(r\) colors
• An anti-Ramsey theorem
• An anti-Ramsey theorem on cycles
• An anti-Ramsey theorem on diamonds
• Graph Theory and Probability
• Graph theory with applications
• Rainbow generalizations of Ramsey theory: A survey
• Rainbow numbers for cycles with pendant edges
• Rainbow numbers for matchings and complete graphs

Cited in

(7)

• Rainbow numbers for cycles with pendant edges
• Rainbow numbers for small stars with one edge added
• Anti-Ramsey numbers in complete split graphs
• Anti-Ramsey numbers for disjoint copies of graphs
• The rainbow numbers of cycles in maximal bipartite planar graph
• Rainbow numbers for certain graphs
• Rainbow numbers for paths in planar graphs

This page was built for publication: Rainbow numbers for graphs containing small cycles

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