Geodesic
Decomposing graphs into a spanning tree, an even graph, and a star forest
Kasper Szabo Lyngsie1 ; Martin Merker1
1Technical University of Denmark
The electronic journal of combinatorics, Tome 26 (2019) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We prove that every connected graph can be edge-decomposed into a spanning tree, an even graph, and a star forest.
DOI : 10.37236/7970
Classification : 05C05, 05C38

Kasper Szabo Lyngsie  1   ; Martin Merker  1

1 Technical University of Denmark 
@article{10_37236_7970,
     author = {Kasper Szabo Lyngsie and Martin Merker},
     title = {Decomposing graphs into a spanning tree, an even graph, and a star forest},
     journal = {The electronic journal of combinatorics},
     year = {2019},
     volume = {26},
     number = {1},
     doi = {10.37236/7970},
     zbl = {1409.05058},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/7970/}
}
TY  - JOUR
AU  - Kasper Szabo Lyngsie
AU  - Martin Merker
TI  - Decomposing graphs into a spanning tree, an even graph, and a star forest
JO  - The electronic journal of combinatorics
PY  - 2019
VL  - 26
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/7970/
DO  - 10.37236/7970
ID  - 10_37236_7970
ER  - 
%0 Journal Article
%A Kasper Szabo Lyngsie
%A Martin Merker
%T Decomposing graphs into a spanning tree, an even graph, and a star forest
%J The electronic journal of combinatorics
%D 2019
%V 26
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/7970/
%R 10.37236/7970
%F 10_37236_7970
Kasper Szabo Lyngsie; Martin Merker. Decomposing graphs into a spanning tree, an even graph, and a star forest. The electronic journal of combinatorics, Tome 26 (2019) no. 1. doi: 10.37236/7970

Cité par Sources :