Geodesic
Embedding a forest in a graph
The electronic journal of combinatorics, Tome 18 (2011) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

For $p\ge 1$, we prove that every forest with $p$ trees whose sizes are $a_1, \ldots, a_p$ can be embedded in any graph containing at least $\sum_{i=1}^p (a_i + 1)$ vertices and having minimum degree at least $\sum_{i=1}^p a_i$.
DOI : 10.37236/586
Classification : 05C35, 05C60 
@article{10_37236_586,
     author = {Mark K. Goldberg and Malik Magdon-Ismail},
     title = {Embedding a forest in a graph},
     journal = {The electronic journal of combinatorics},
     year = {2011},
     volume = {18},
     number = {1},
     doi = {10.37236/586},
     zbl = {1217.05113},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/586/}
}
TY  - JOUR
AU  - Mark K. Goldberg
AU  - Malik Magdon-Ismail
TI  - Embedding a forest in a graph
JO  - The electronic journal of combinatorics
PY  - 2011
VL  - 18
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/586/
DO  - 10.37236/586
ID  - 10_37236_586
ER  - 
%0 Journal Article
%A Mark K. Goldberg
%A Malik Magdon-Ismail
%T Embedding a forest in a graph
%J The electronic journal of combinatorics
%D 2011
%V 18
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/586/
%R 10.37236/586
%F 10_37236_586
Mark K. Goldberg; Malik Magdon-Ismail. Embedding a forest in a graph. The electronic journal of combinatorics, Tome 18 (2011) no. 1. doi: 10.37236/586

Cité par Sources :