Geodesic
List edge-colorings of series-parallel graphs
The electronic journal of combinatorics, Tome 6 (1999)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

It is proved that for every integer $k\ge3$, for every (simple) series-parallel graph $G$ with maximum degree at most $k$, and for every collection $(L(e):e\in E(G))$ of sets, each of size at least $k$, there exists a proper edge-coloring of $G$ such that for every edge $e\in E(G)$, the color of $e$ belongs to $L(e)$.
DOI : 10.37236/1474
Classification : 05C15
Mots-clés : series-parallel graph, edge-coloring 
@article{10_37236_1474,
     author = {Martin Juvan and Bojan Mohar and Robin Thomas},
     title = {List edge-colorings of series-parallel graphs},
     journal = {The electronic journal of combinatorics},
     year = {1999},
     volume = {6},
     doi = {10.37236/1474},
     zbl = {0939.05039},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1474/}
}
TY  - JOUR
AU  - Martin Juvan
AU  - Bojan Mohar
AU  - Robin Thomas
TI  - List edge-colorings of series-parallel graphs
JO  - The electronic journal of combinatorics
PY  - 1999
VL  - 6
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1474/
DO  - 10.37236/1474
ID  - 10_37236_1474
ER  - 
%0 Journal Article
%A Martin Juvan
%A Bojan Mohar
%A Robin Thomas
%T List edge-colorings of series-parallel graphs
%J The electronic journal of combinatorics
%D 1999
%V 6
%U http://geodesic.mathdoc.fr/articles/10.37236/1474/
%R 10.37236/1474
%F 10_37236_1474
Martin Juvan; Bojan Mohar; Robin Thomas. List edge-colorings of series-parallel graphs. The electronic journal of combinatorics, Tome 6 (1999). doi: 10.37236/1474

Cité par Sources :