Choosability of Graphs with Bounded Order: Ohbaʼs Conjecture and Beyond
- 1 September 2013
- journal article
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 43, 89-95
Abstract
No abstract availableAll Related Versions
This publication has 7 references indexed in Scilit:
- Ohba’s conjecture for graphs with independence number fiveDiscrete Mathematics, 2011
- On chromatic‐choosable graphsJournal of Graph Theory, 2002
- On the choosability of complete multipartite graphs with part size threeDiscrete Mathematics, 2000
- Graph colorings with local constraints -- a surveyDiscussiones Mathematicae Graph Theory, 1997
- Every Planar Graph Is 5-ChoosableJournal of Combinatorial Theory, Series B, 1994
- Choice Numbers of Graphs: a Probabilistic ApproachCombinatorics, Probability and Computing, 1992
- Distinct representatives of subsetsBulletin of the American Mathematical Society, 1948