Geodesic
Every plane graph is facially-non-repetitively \(C\)-choosable
Grzegorz Gutowski1
1Jagiellonian University
The electronic journal of combinatorics, Tome 25 (2018) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

A sequence $\left(x_1,x_2,\ldots,x_{2n}\right)$ of even length is a repetition if $\left(x_1,\ldots,x_n\right) =\left(x_{n+1},\ldots,x_{2n}\right)$. We prove existence of a constant $C < 10^{4 \cdot 10^7}$ such that given any planar drawing of a graph $G$, and a list $L(v)$ of $C$ permissible colors for each vertex $v$ in $G$, there is a choice of a permissible color for each vertex such that the sequence of colors of the vertices on any facial simple path in $G$ is not a repetition.
DOI : 10.37236/7129
Classification : 05C15, 05C10
Mots-clés : planar graphs, non-repetitive colorings

Grzegorz Gutowski  1

1 Jagiellonian University 
@article{10_37236_7129,
     author = {Grzegorz Gutowski},
     title = {Every plane graph is facially-non-repetitively {\(C\)-choosable}},
     journal = {The electronic journal of combinatorics},
     year = {2018},
     volume = {25},
     number = {1},
     doi = {10.37236/7129},
     zbl = {1391.05108},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/7129/}
}
TY  - JOUR
AU  - Grzegorz Gutowski
TI  - Every plane graph is facially-non-repetitively \(C\)-choosable
JO  - The electronic journal of combinatorics
PY  - 2018
VL  - 25
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/7129/
DO  - 10.37236/7129
ID  - 10_37236_7129
ER  - 
%0 Journal Article
%A Grzegorz Gutowski
%T Every plane graph is facially-non-repetitively \(C\)-choosable
%J The electronic journal of combinatorics
%D 2018
%V 25
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/7129/
%R 10.37236/7129
%F 10_37236_7129
Grzegorz Gutowski. Every plane graph is facially-non-repetitively \(C\)-choosable. The electronic journal of combinatorics, Tome 25 (2018) no. 1. doi: 10.37236/7129

Cité par Sources :