Geodesic
The Borodin-Kostochka conjecture for graphs containing a doubly critical edge
The electronic journal of combinatorics, Tome 14 (2007)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We prove that if $G$ is a graph containing a doubly-critical edge and satisfying $\chi \geq \Delta \geq 6$, then $G$ contains a $K_{\Delta}$.
DOI : 10.37236/1023
Classification : 05C15, 05C35, 05C38
Mots-clés : double critical edge, lonely path lemma, optimal coloring, vertex disjoint paths 
@article{10_37236_1023,
     author = {Landon Rabern},
     title = {The {Borodin-Kostochka} conjecture for graphs containing a doubly critical edge},
     journal = {The electronic journal of combinatorics},
     year = {2007},
     volume = {14},
     doi = {10.37236/1023},
     zbl = {1157.05309},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1023/}
}
TY  - JOUR
AU  - Landon Rabern
TI  - The Borodin-Kostochka conjecture for graphs containing a doubly critical edge
JO  - The electronic journal of combinatorics
PY  - 2007
VL  - 14
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1023/
DO  - 10.37236/1023
ID  - 10_37236_1023
ER  - 
%0 Journal Article
%A Landon Rabern
%T The Borodin-Kostochka conjecture for graphs containing a doubly critical edge
%J The electronic journal of combinatorics
%D 2007
%V 14
%U http://geodesic.mathdoc.fr/articles/10.37236/1023/
%R 10.37236/1023
%F 10_37236_1023
Landon Rabern. The Borodin-Kostochka conjecture for graphs containing a doubly critical edge. The electronic journal of combinatorics, Tome 14 (2007). doi: 10.37236/1023

Cité par Sources :