On the fine-grained complexity of rainbow coloring
From MaRDI portal
(Redirected from Publication:3174728)
Recommendations
Cites work
- scientific article; zbMATH DE number 5776838 (Why is no real title available?)
- scientific article; zbMATH DE number 1261820 (Why is no real title available?)
- A Dynamic Programming Approach to Sequencing Problems
- A note on the complexity of the chromatic number problem
- A simplified NP-complete satisfiability problem
- Chromatic graph theory
- Hardness and algorithms for rainbow connection
- Inapproximability of Rainbow Colouring
- On rainbow connection
- On set intersection representations of graphs
- On the complexity of k-SAT
- On the fine-grained complexity of rainbow coloring
- On the rainbow connectivity of graphs: complexity and FPT algorithms
- Parameterized algorithms
- Rainbow Colouring of Split and Threshold Graphs
- Rainbow colouring of split graphs
- Rainbow connection in graphs
- Rainbow connectivity: hardness and tractability
- Tight Bounds for Graph Homomorphism and Subgraph Isomorphism
- Tight lower bound for the channel assignment problem
- Which problems have strongly exponential complexity?
Cited in
(14)- A survey on rainbow (vertex-)index of graphs
- On finding rainbow and colorful paths
- The parameterized complexity of the rainbow subgraph problem
- The parameterized complexity of the rainbow subgraph problem
- On the complexity of \(k\)-rainbow cycle colouring problems
- Inapproximability of Rainbow Colouring
- The maximum 2-edge-colorable subgraph problem and its fixed-parameter tractability
- Fine-Grained Complexity of Rainbow Coloring and its Variants.
- Your rugby mates don't need to know your colleagues: triadic closure with edge colors
- On the complexity of rainbow vertex colouring diametral path graphs
- The algorithmic complexity of colour switching
- Quadratic vertex kernel for rainbow matching
- On the fine-grained complexity of rainbow coloring
- Fine-grained complexity of rainbow coloring and its variants
This page was built for publication: On the fine-grained complexity of rainbow coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174728)