On the Choice Numbers of Some Complete Multipartite Graphs
From MaRDI portal
Publication:3595449
DOI10.1007/978-3-540-70666-3_4zbMATH Open1149.05309OpenAlexW1605971050MaRDI QIDQ3595449FDOQ3595449
Authors: V. L. Chia, Gek L. Chia 
Publication date: 28 August 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70666-3_4
Recommendations
Cited In (20)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On list chromatic number of \(L(2,0)\)-labeling of a complete bipartite graph \(K_{2,n}\)
- Choice number of some complete multi-partite graphs
- On the subspace choosability in graphs
- Title not available (Why is that?)
- On the asymptotic value of the choice number of complete multi‐partite graphs
- On the choosability of complete multipartite graphs with part size three
- Proportional choosability of complete bipartite graphs
- Paintability of complete bipartite graphs
- List coloring and \(n\)-monophilic graphs.
- The choice number of \(K(4,2,\dots,2)\) -- a dispute resolved
- On choosability of some complete multipartite graphs and Ohba's conjecture
- Title not available (Why is that?)
- On-line choice number of complete multipartite graphs: an algorithmic approach
- Choosability with separation of complete multipartite graphs and hypergraphs
- List colorings with distinct list sizes, the case of complete bipartite graphs
- On the choice number of complete multipartite graphs with part size four
- List Set Colouring: Bounds and Algorithms
- List coloring of complete multipartite 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)
