Rainbow numbers for graphs containing small cycles

DOI10.1007/S00373-015-1577-7zbMATH Open1327.05178OpenAlexW2076672288MaRDI QIDQ897256FDOQ897256

Roman Soták, Ingo Schiermeyer

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

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

zbMATH Keywords

anti-Ramsey numberrainbow numberrainbow colouring[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Tur%EF%BF%BD%EF%BF%BDn+number&go=Go Tur��n number]

Mathematics Subject Classification ID

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

Cites Work

• Graph Theory and Probability
• Title not available (Why is that?)
• Title not available (Why is that?)
• Rainbow numbers for cycles with pendant edges
• A rainbow \(k\)-matching in the complete graph with \(r\) colors
• Rainbow numbers for matchings and complete graphs
• An anti-Ramsey theorem on cycles
• Rainbow generalizations of Ramsey theory: A survey
• An anti-Ramsey theorem
• An anti-Ramsey theorem on diamonds

Cited In (4)

• Rainbow numbers for certain graphs
• Anti-Ramsey numbers in complete split graphs
• Rainbow numbers for paths in planar graphs
• Anti-Ramsey numbers for disjoint copies of 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)