Geodesic
Partitions and edge colourings of multigraphs
The electronic journal of combinatorics, Tome 15 (2008)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Erdős and Lovász conjectured in 1968 that for every graph $G$ with $\chi(G)>\omega(G)$ and any two integers $s,t\geq 2$ with $s+t=\chi(G)+1$, there is a partition $(S,T)$ of the vertex set $V(G)$ such that $\chi(G[S])\geq s$ and $\chi(G[T])\geq t$. Except for a few cases, this conjecture is still unsolved. In this note we prove the conjecture for line graphs of multigraphs.
DOI : 10.37236/900
Classification : 05C15, 05C70 
@article{10_37236_900,
     author = {Alexandr V. Kostochka and Michael Stiebitz},
     title = {Partitions and edge colourings of multigraphs},
     journal = {The electronic journal of combinatorics},
     year = {2008},
     volume = {15},
     doi = {10.37236/900},
     zbl = {1160.05317},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/900/}
}
TY  - JOUR
AU  - Alexandr V. Kostochka
AU  - Michael Stiebitz
TI  - Partitions and edge colourings of multigraphs
JO  - The electronic journal of combinatorics
PY  - 2008
VL  - 15
UR  - http://geodesic.mathdoc.fr/articles/10.37236/900/
DO  - 10.37236/900
ID  - 10_37236_900
ER  - 
%0 Journal Article
%A Alexandr V. Kostochka
%A Michael Stiebitz
%T Partitions and edge colourings of multigraphs
%J The electronic journal of combinatorics
%D 2008
%V 15
%U http://geodesic.mathdoc.fr/articles/10.37236/900/
%R 10.37236/900
%F 10_37236_900
Alexandr V. Kostochka; Michael Stiebitz. Partitions and edge colourings of multigraphs. The electronic journal of combinatorics, Tome 15 (2008). doi: 10.37236/900

Cité par Sources :