Complexity of Computing the Anti-Ramsey Numbers for Paths.
From MaRDI portal
Publication:5089164
Recommendations
- Publication:3201758
- Complexity of Ramsey null sets
- Anti-Ramsey numbers of paths and cycles in hypergraphs
- Computing the anti-Ramsey number for trees in complete tripartite graph
- Computation of Ramsey numbers R(C_m,W_n)
- Ramsey goodness of paths
- The computational complexity of antimatroid properties
- On the complexity of paths avoiding forbidden pairs
Cites work
- 3-consecutive edge coloring of a graph
- 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 2192164 (Why is no real title available?)
- On restricted colourings of \(K_ n\)
- Polychromatic Hamilton cycles
- Rainbow generalizations of Ramsey theory: A survey
- Rainbow numbers for matchings and complete graphs
- The anti-Ramsey number of perfect matching
- Vertex colorings without rainbow subgraphs
- 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 Q5089164)
