Geodesic
Graceful tree conjecture for infinite trees
The electronic journal of combinatorics, Tome 16 (2009) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

One of the most famous open problems in graph theory is the Graceful Tree Conjecture, which states that every finite tree has a graceful labeling. In this paper, we define graceful labelings for countably infinite graphs, and state and verify a Graceful Tree Conjecture for countably infinite trees.
DOI : 10.37236/154
Classification : 05C78, 05C05
Mots-clés : graceful tree conjecture, countably infinite trees, gaceful labeling 
@article{10_37236_154,
     author = {Tsz Lung Chan and Wai Shun Cheung and Tuen Wai Ng},
     title = {Graceful tree conjecture for infinite trees},
     journal = {The electronic journal of combinatorics},
     year = {2009},
     volume = {16},
     number = {1},
     doi = {10.37236/154},
     zbl = {1188.05110},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/154/}
}
TY  - JOUR
AU  - Tsz Lung Chan
AU  - Wai Shun Cheung
AU  - Tuen Wai Ng
TI  - Graceful tree conjecture for infinite trees
JO  - The electronic journal of combinatorics
PY  - 2009
VL  - 16
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/154/
DO  - 10.37236/154
ID  - 10_37236_154
ER  - 
%0 Journal Article
%A Tsz Lung Chan
%A Wai Shun Cheung
%A Tuen Wai Ng
%T Graceful tree conjecture for infinite trees
%J The electronic journal of combinatorics
%D 2009
%V 16
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/154/
%R 10.37236/154
%F 10_37236_154
Tsz Lung Chan; Wai Shun Cheung; Tuen Wai Ng. Graceful tree conjecture for infinite trees. The electronic journal of combinatorics, Tome 16 (2009) no. 1. doi: 10.37236/154

Cité par Sources :