Complexity of Computing the Anti-Ramsey Numbers for Paths.

DOI10.4230/LIPIcs.MFCS.2020.6OpenAlexW3082499076MaRDI QIDQ5089164

No author found.

Publication date: 18 July 2022

Full work available at URL: https://arxiv.org/abs/1810.08004

zbMATH Keywords

algorithmapproximationNP-hardcoloringanti-RamseyETH

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Vertex colorings without rainbow subgraphs
• Approximation and hardness results for the maximum edge \(q\)-coloring problem
• Rainbow generalizations of Ramsey theory: A survey
• 3-consecutive edge coloring of a graph
• Polychromatic Hamilton cycles
• The anti-Ramsey number of perfect matching
• On restricted colourings of \(K_ n\)
• Approximation algorithm for maximum edge coloring
• Complete solution for the rainbow numbers of matchings
• Edge-colorings of complete graphs that avoid polychromatic trees
• Which problems have strongly exponential complexity?
• Edge-colorings with no large polychromatic stars
• Anti-Ramsey colorings in several rounds
• Rainbow numbers for matchings and complete graphs
• An anti-Ramsey theorem on cycles
• Approximation and Hardness Results for the Maximum Edge q-coloring Problem
• Bipartite anti-Ramsey numbers of cycles
• Approximation Algorithms for Maximum Edge Coloring Problem

This page was built for publication: Complexity of Computing the Anti-Ramsey Numbers for Paths.