Choosability of Graphs with Bounded Order: Ohbaʼs Conjecture and Beyond
Author/Authors :
Noel، نويسنده , , Jonathan A. and Reed، نويسنده , , Bruce A. and West، نويسنده , , Douglas B. and Wu، نويسنده , , Hehui and Zhu، نويسنده , , Xuding، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2013
Pages :
7
From page :
89
To page :
95
Abstract :
We discuss some recent results and conjectures on bounding the choice number of a graph G under the condition that | V ( G ) | is bounded above by a fixed function of χ ( G ) .
