Complexity of computing the anti-Ramsey numbers for paths
From MaRDI portal
Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cites work
- An anti-Ramsey theorem on cycles
- Anti-Ramsey colorings in several rounds
- Approximation algorithm for maximum edge coloring
- Approximation Algorithms for Maximum Edge Coloring Problem
- Approximation and hardness results for the maximum edge q-coloring problem
- Approximation and Hardness Results for the Maximum Edge q-coloring Problem
- Bipartite anti-Ramsey numbers of cycles
- Complete solution for the rainbow numbers of matchings
- Edge-colorings of complete graphs that avoid polychromatic trees
- Edge-colorings with no large polychromatic stars
- scientific article; zbMATH DE number 3494450 (Why is no real title available?)
- scientific article; zbMATH DE number 1432797 (Why is no real title available?)
- scientific article; zbMATH DE number 2192164 (Why is no real title available?)
- On maximal paths and circuits of graphs
- On restricted colourings of \(K_ n\)
- Polychromatic Hamilton cycles
- Rainbow numbers for matchings and complete graphs
- The anti-Ramsey number of perfect matching
- Which problems have strongly exponential complexity?
This page was built for publication: Complexity of computing the anti-Ramsey numbers for paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6985811)
