Geodesic
A note on packing graphs without cycles of length up to five
The electronic journal of combinatorics, Tome 16 (2009) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

The following statement was conjectured by Faudree, Rousseau, Schelp and Schuster: if a graph $G$ is a non-star graph without cycles of length $m \leq 4$ then $G$ is a subgraph of its complement. So far the best result concerning this conjecture is that every non-star graph $G$ without cycles of length $m \leq 6$ is a subgraph of its complement. In this note we show that $m\leq 6$ can be replaced by $m \leq 5$.
DOI : 10.37236/268
Classification : 05C70 
@article{10_37236_268,
     author = {Agnieszka G\"orlich and Andrzej \.Zak},
     title = {A note on packing graphs without cycles of length up to five},
     journal = {The electronic journal of combinatorics},
     year = {2009},
     volume = {16},
     number = {1},
     doi = {10.37236/268},
     zbl = {1186.05096},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/268/}
}
TY  - JOUR
AU  - Agnieszka Görlich
AU  - Andrzej Żak
TI  - A note on packing graphs without cycles of length up to five
JO  - The electronic journal of combinatorics
PY  - 2009
VL  - 16
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/268/
DO  - 10.37236/268
ID  - 10_37236_268
ER  - 
%0 Journal Article
%A Agnieszka Görlich
%A Andrzej Żak
%T A note on packing graphs without cycles of length up to five
%J The electronic journal of combinatorics
%D 2009
%V 16
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/268/
%R 10.37236/268
%F 10_37236_268
Agnieszka Görlich; Andrzej Żak. A note on packing graphs without cycles of length up to five. The electronic journal of combinatorics, Tome 16 (2009) no. 1. doi: 10.37236/268

Cité par Sources :