Geodesic
Decomposing dense bipartite graphs into 4-cycles
Nicholas Cavenagh1
1Waikato University
The electronic journal of combinatorics, Tome 22 (2015) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Let $G$ be an even bipartite graph with partite sets $X$ and $Y$ such that $|Y|$ is even and the minimum degree of a vertex in $Y$ is at least $95|X|/96$. Suppose furthermore that the number of edges in $G$ is divisible by $4$. Then $G$ decomposes into 4-cycles.
DOI : 10.37236/3444
Classification : 05C70, 05C35, 05C38
Mots-clés : graph decomposition, extremal graph theory

Nicholas Cavenagh  1

1 Waikato University 
@article{10_37236_3444,
     author = {Nicholas Cavenagh},
     title = {Decomposing dense bipartite graphs into 4-cycles},
     journal = {The electronic journal of combinatorics},
     year = {2015},
     volume = {22},
     number = {1},
     doi = {10.37236/3444},
     zbl = {1308.05088},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/3444/}
}
TY  - JOUR
AU  - Nicholas Cavenagh
TI  - Decomposing dense bipartite graphs into 4-cycles
JO  - The electronic journal of combinatorics
PY  - 2015
VL  - 22
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/3444/
DO  - 10.37236/3444
ID  - 10_37236_3444
ER  - 
%0 Journal Article
%A Nicholas Cavenagh
%T Decomposing dense bipartite graphs into 4-cycles
%J The electronic journal of combinatorics
%D 2015
%V 22
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/3444/
%R 10.37236/3444
%F 10_37236_3444
Nicholas Cavenagh. Decomposing dense bipartite graphs into 4-cycles. The electronic journal of combinatorics, Tome 22 (2015) no. 1. doi: 10.37236/3444

Cité par Sources :