Exact and parameterized algorithms for choosability
From MaRDI portal
Cites work
- A proof of a conjecture of Ohba
- Choosability of P 5-Free Graphs
- Choosability on \(H\)-free graphs
- Coloring graphs from lists with bounded size of their union
- Colorings and orientations of graphs
- Computing the chromatic number using graph decompositions via matrix rank
- Disjoint clique cutsets in graphs without long holes
- Double-exponential and triple-exponential bounds for choosability problems parameterized by treewidth
- Fine-grained parameterized complexity analysis of graph coloring problems
- Fourier meets M\"{o}bius: fast subset convolution
- scientific article; zbMATH DE number 446487 (Why is no real title available?)
- scientific article; zbMATH DE number 3735847 (Why is no real title available?)
- Intractability of clique-width parameterizations
- Kernelization. Theory of parameterized preprocessing
- List Coloring with a Bounded Palette
- List colouring when the chromatic number is close to the order of the graph
- On the complexity of some colorful problems parameterized by treewidth
- Parameterized algorithms
- Some results on (a:b)-choosability
- The complexity of planar graph choosability
- The list chromatic number of graphs with small clique number
- Tight double exponential lower bounds
- Tight lower bounds for list edge coloring
This page was built for publication: Exact and parameterized algorithms for choosability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6965609)
