On the Choice Numbers of Some Complete Multipartite Graphs
From MaRDI portal
Publication:3595449
Recommendations
Cited in
(20)- On the subspace choosability in graphs
- scientific article; zbMATH DE number 842014 (Why is no real title available?)
- On the asymptotic value of the choice number of complete multi‐partite graphs
- The choice number of \(K(4,2,\dots,2)\) -- a dispute resolved
- Choice number of some complete multi-partite graphs
- On the choosability of complete multipartite graphs with part size three
- List Set Colouring: Bounds and Algorithms
- scientific article; zbMATH DE number 2188340 (Why is no real title available?)
- On the choice number of complete multipartite graphs with part size four
- List coloring and \(n\)-monophilic graphs.
- Proportional choosability of complete bipartite graphs
- scientific article; zbMATH DE number 7296014 (Why is no real title available?)
- Paintability of complete bipartite graphs
- scientific article; zbMATH DE number 2192112 (Why is no real title available?)
- On choosability of some complete multipartite graphs and Ohba's conjecture
- List coloring of complete multipartite graphs
- On-line choice number of complete multipartite graphs: an algorithmic approach
- Choosability with separation of complete multipartite graphs and hypergraphs
- On list chromatic number of \(L(2,0)\)-labeling of a complete bipartite graph \(K_{2,n}\)
- List colorings with distinct list sizes, the case of complete bipartite graphs
This page was built for publication: On the Choice Numbers of Some Complete Multipartite Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3595449)
