Geodesic
Covering a graph with cycles of length at least 4
Hong Wang1
1University of Idaho
The electronic journal of combinatorics, Tome 25 (2018) 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 a graph of order $n\geq 4k$, where $k$ is a positive integer. Suppose that the minimum degree of $G$ is at least $\lceil n/2\rceil$. We show that $G$ contains $k$ vertex-disjoint cycles covering all the vertices of $G$ such that $k-1$ of them are quadrilaterals.
DOI : 10.37236/4099
Classification : 05C38, 05C70, 05C75
Mots-clés : cycles, disjoint cycles, cycle coverings

Hong Wang  1

1 University of Idaho 
@article{10_37236_4099,
     author = {Hong Wang},
     title = {Covering a graph with cycles of length at least 4},
     journal = {The electronic journal of combinatorics},
     year = {2018},
     volume = {25},
     number = {1},
     doi = {10.37236/4099},
     zbl = {1391.05149},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/4099/}
}
TY  - JOUR
AU  - Hong Wang
TI  - Covering a graph with cycles of length at least 4
JO  - The electronic journal of combinatorics
PY  - 2018
VL  - 25
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/4099/
DO  - 10.37236/4099
ID  - 10_37236_4099
ER  - 
%0 Journal Article
%A Hong Wang
%T Covering a graph with cycles of length at least 4
%J The electronic journal of combinatorics
%D 2018
%V 25
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/4099/
%R 10.37236/4099
%F 10_37236_4099
Hong Wang. Covering a graph with cycles of length at least 4. The electronic journal of combinatorics, Tome 25 (2018) no. 1. doi: 10.37236/4099

Cité par Sources :