On \((k, k n - k^2 - 2 k - 1)\)-choosability of \(n\)-vertex graphs

DOI10.1155/2015/690517zbMath1448.05070DBLPjournals/ijmmsc/Charoenpanitseri15OpenAlexW1567537165WikidataQ59109853 ScholiaQ59109853MaRDI QIDQ1751381

Wongsakorn Charoenpanitseri

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

zbMATH Keywords

\(L\)-coloring\((k, t)\)-list assignment

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

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

This page was built for publication: On \((k, k n - k^2 - 2 k - 1)\)-choosability of \(n\)-vertex graphs