𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Choice number and energy of graphs

✍ Scribed by Saieed Akbari; Ebrahim Ghorbani

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
87 KB
Volume
429
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Graphs whose choice number is equal to t
Graphs whose choice number is equal to their chromatic number
✍ Gravier, Sylvain; Maffray, FrοΏ½dοΏ½ric πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 219 KB

A graph G is k-choosable if it admits a vertex-coloring whenever the colors allowed at each vertex are restricted to a list of length k. If Ο‡ denotes the usual chromatic number of G, we are interested in which kind of G is Ο‡-choosable. This question contains a famous conjecture, which states that ev

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.

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},

Degrees and choice numbers
Degrees and choice numbers
✍ Noga Alon πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 74 KB

The choice number ch G of a graph G = V E is the minimum number k such that for every assignment of a list S v of at least k colors to each vertex v ∈ V , there is a proper vertex coloring of G assigning to each vertex v a color from its list S v . We prove that if the minimum degree of G is d, then