Geodesic
Decompositions of graphs into 5-cycles and other small graphs
The electronic journal of combinatorics, Tome 12 (2005)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

In this paper we consider the problem of finding the smallest number $q$ such that any graph $G$ of order $n$ admits a decomposition into edge disjoint copies of a fixed graph $H$ and single edges with at most $q$ elements. We solve the case when $H$ is the 5-cycle, the 5-cycle with a chord and any connected non-bipartite non-complete graph of order 4.
DOI : 10.37236/1946
Classification : 05C35, 05C70 
@article{10_37236_1946,
     author = {Teresa Sousa},
     title = {Decompositions of graphs into 5-cycles and other small graphs},
     journal = {The electronic journal of combinatorics},
     year = {2005},
     volume = {12},
     doi = {10.37236/1946},
     zbl = {1079.05044},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1946/}
}
TY  - JOUR
AU  - Teresa Sousa
TI  - Decompositions of graphs into 5-cycles and other small graphs
JO  - The electronic journal of combinatorics
PY  - 2005
VL  - 12
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1946/
DO  - 10.37236/1946
ID  - 10_37236_1946
ER  - 
%0 Journal Article
%A Teresa Sousa
%T Decompositions of graphs into 5-cycles and other small graphs
%J The electronic journal of combinatorics
%D 2005
%V 12
%U http://geodesic.mathdoc.fr/articles/10.37236/1946/
%R 10.37236/1946
%F 10_37236_1946
Teresa Sousa. Decompositions of graphs into 5-cycles and other small graphs. The electronic journal of combinatorics, Tome 12 (2005). doi: 10.37236/1946

Cité par Sources :