Some results on \((a:b)\)-choosability
From MaRDI portal
Publication:1025484
DOI10.1016/J.DISC.2008.04.061zbMath1198.05049OpenAlexW2012996595WikidataQ56390735 ScholiaQ56390735MaRDI QIDQ1025484
Publication date: 19 June 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.04.061
probabilistic methods(a:b)-choosabilitycomplexity of graph choosabilityk-th choice number of a graphlist-chromatic conjecturestrong chromatic number
Related Items (13)
Path choosability of planar graphs ⋮ Free choosability of outerplanar graphs ⋮ On the subspace choosability in graphs ⋮ Edge (m,k)-choosability of graphs ⋮ Every triangle-free induced subgraph of the triangular lattice is \((5m,2m)\)-choosable ⋮ Choosability of P 5-Free Graphs ⋮ The complexity of planar graph choosability ⋮ Optimal channel assignment with list-edge coloring ⋮ On the complexity of some colorful problems parameterized by treewidth ⋮ A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs ⋮ The trouble with the second quantifier ⋮ On some FPT problems without polynomial Turing compressions ⋮ On structure of some plane graphs with application to choosability
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of planar graph choosability
- Colorings and orientations of graphs
- A solution to a colouring problem of P. Erdős
- The complexity of comparability graph recognition and coloring
- The list chromatic index of a bipartite multigraph
- List edge colourings of some 1-factorable multigraphs
- A note on list-colorings
- The strong chromatic number of a graph
- Graph colorings with local constraints -- a survey
- Choice Numbers of Graphs: a Probabilistic Approach
- The chromatic number of random graphs
This page was built for publication: Some results on \((a:b)\)-choosability
