On \((k, k n - k^2 - 2 k - 1)\)-choosability of \(n\)-vertex graphs
From MaRDI portal
Publication:1751381
DOI10.1155/2015/690517zbMath1448.05070OpenAlexW1567537165WikidataQ59109853 ScholiaQ59109853MaRDI QIDQ1751381
Publication date: 25 May 2018
Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2015/690517
Cites Work
- Choice number of complete multipartite graphs \(K_{3*3,2*(k - 5),1*2}\) and \(K_{4,3*2,2*(k - 6),1*3}\)
- Every planar graph is 5-choosable
- On 3-choosability of plane graphs without 6-, 7- and 9-cycles
- The 3-choosability of plane graphs of girth 4
- 3-list-coloring planar graphs of girth 5
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item