Geodesic
Restricted extension of sparse partial edge colorings of complete graphs
Carl Johan Casselgren1 ; Lan Anh Pham
1Dept. of Mathematics, Linköping University
The electronic journal of combinatorics, Tome 28 (2021) no. 2
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Given a partial edge coloring of a complete graph $K_n$ and lists of allowed colors for the non-colored edges of $K_n$, can we extend the partial edge coloring to a proper edge coloring of $K_n$ using only colors from the lists? We prove that this question has a positive answer in the case when both the partial edge coloring and the color lists satisfy certain sparsity conditions.
DOI : 10.37236/9552
Classification : 05C15, 05B15
Mots-clés : sparse precoloring, edge precoloring extension problems

Carl Johan Casselgren  1   ; Lan Anh Pham 

1 Dept. of Mathematics, Linköping University 
@article{10_37236_9552,
     author = {Carl Johan Casselgren and Lan Anh Pham},
     title = {Restricted extension of sparse partial edge colorings of complete graphs},
     journal = {The electronic journal of combinatorics},
     year = {2021},
     volume = {28},
     number = {2},
     doi = {10.37236/9552},
     zbl = {1461.05084},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/9552/}
}
TY  - JOUR
AU  - Carl Johan Casselgren
AU  - Lan Anh Pham
TI  - Restricted extension of sparse partial edge colorings of complete graphs
JO  - The electronic journal of combinatorics
PY  - 2021
VL  - 28
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.37236/9552/
DO  - 10.37236/9552
ID  - 10_37236_9552
ER  - 
%0 Journal Article
%A Carl Johan Casselgren
%A Lan Anh Pham
%T Restricted extension of sparse partial edge colorings of complete graphs
%J The electronic journal of combinatorics
%D 2021
%V 28
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/9552/
%R 10.37236/9552
%F 10_37236_9552
Carl Johan Casselgren; Lan Anh Pham. Restricted extension of sparse partial edge colorings of complete graphs. The electronic journal of combinatorics, Tome 28 (2021) no. 2. doi: 10.37236/9552

Cité par Sources :