𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Lucky Choice Number of Graphs

✍ Scribed by S. Akbari, M. Ghanbari, R. Manaviyat, S. Zare

Book ID
120788665
Publisher
Springer Japan
Year
2011
Tongue
English
Weight
151 KB
Volume
29
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the choice number of claw-free perfec
On the choice number of claw-free perfect graphs
✍ Sylvain Gravier; FrΓ©dΓ©ric Maffray πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 273 KB

We prove that every 3-chromatic claw-free perfect graph is 3-choosable.

Choice number and energy of graphs
Choice number and energy of graphs
✍ Saieed Akbari; Ebrahim Ghorbani πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 87 KB
Choice number of 3-colorable elementary
Choice number of 3-colorable elementary graphs
✍ Sylvain Gravier; FrΓ©dΓ©ric Maffray πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 394 KB

We show that the choice number of a graph G is equal to its chromatic number when G belongs to a restricted class of claw-free graphs, in view of the conjecture that this is true for every claw-free graph. We consider only finite, undirected graphs, without loops. Given a graph G = ( V, E), a k-col

On the asymptotic value of the choice nu
On the asymptotic value of the choice number of complete multi-partite graphs
✍ Nurit Gazit; Michael Krivelevich πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 144 KB πŸ‘ 1 views

## Abstract We calculate the asymptotic value of the choice number of complete multi‐partite graphs, given certain limitations on the relation between the sizes of the different sides. In the bipartite case, we prove that if __n__~0~ ≀ __n__~1~ and log__n__~0~ ≫ loglog__n__~1~, then $ch(K\_{n\_{0},