Geodesic
A better lower bound on average degree of 4-list-critical graphs
Landon Rabern1
1LBD Data
The electronic journal of combinatorics, Tome 23 (2016) no. 3
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

This short note proves that every non-complete $k$-list-critical graph has average degree at least $k-1 + \frac{k-3}{k^2-2k+2}$. This improves the best known bound for $k = 4,5,6$. The same bound holds for online $k$-list-critical graphs.
DOI : 10.37236/5971
Classification : 05C07
Mots-clés : average degree, critical graphs

Landon Rabern  1

1 LBD Data 
@article{10_37236_5971,
     author = {Landon Rabern},
     title = {A better lower bound on average degree of 4-list-critical graphs},
     journal = {The electronic journal of combinatorics},
     year = {2016},
     volume = {23},
     number = {3},
     doi = {10.37236/5971},
     zbl = {1344.05049},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/5971/}
}
TY  - JOUR
AU  - Landon Rabern
TI  - A better lower bound on average degree of 4-list-critical graphs
JO  - The electronic journal of combinatorics
PY  - 2016
VL  - 23
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.37236/5971/
DO  - 10.37236/5971
ID  - 10_37236_5971
ER  - 
%0 Journal Article
%A Landon Rabern
%T A better lower bound on average degree of 4-list-critical graphs
%J The electronic journal of combinatorics
%D 2016
%V 23
%N 3
%U http://geodesic.mathdoc.fr/articles/10.37236/5971/
%R 10.37236/5971
%F 10_37236_5971
Landon Rabern. A better lower bound on average degree of 4-list-critical graphs. The electronic journal of combinatorics, Tome 23 (2016) no. 3. doi: 10.37236/5971

Cité par Sources :