Geodesic
On self-complementary cyclic packing of forests
The electronic journal of combinatorics, Tome 14 (2007)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

A graph is self-complementary if it is isomorphic to its complement. In this paper we prove that every forest of order $4p$ and size less than $3p$ is a subgraph of a self-complementary graph of order $4p$ with a cyclic self-complementary permutation. We also discuss some generalization of the main result.
DOI : 10.37236/980
Classification : 05C70, 05C60, 05C05
Mots-clés : self-complemetary graphs, forest, cyclic self-complementary permutation 
@article{10_37236_980,
     author = {A.Pawe{\l} Wojda and Mariusz Wo\'zniak and Irmina A. Zio{\l}o},
     title = {On self-complementary cyclic packing of forests},
     journal = {The electronic journal of combinatorics},
     year = {2007},
     volume = {14},
     doi = {10.37236/980},
     zbl = {1182.05100},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/980/}
}
TY  - JOUR
AU  - A.Paweł Wojda
AU  - Mariusz Woźniak
AU  - Irmina A. Zioło
TI  - On self-complementary cyclic packing of forests
JO  - The electronic journal of combinatorics
PY  - 2007
VL  - 14
UR  - http://geodesic.mathdoc.fr/articles/10.37236/980/
DO  - 10.37236/980
ID  - 10_37236_980
ER  - 
%0 Journal Article
%A A.Paweł Wojda
%A Mariusz Woźniak
%A Irmina A. Zioło
%T On self-complementary cyclic packing of forests
%J The electronic journal of combinatorics
%D 2007
%V 14
%U http://geodesic.mathdoc.fr/articles/10.37236/980/
%R 10.37236/980
%F 10_37236_980
A.Paweł Wojda; Mariusz Woźniak; Irmina A. Zioło. On self-complementary cyclic packing of forests. The electronic journal of combinatorics, Tome 14 (2007). doi: 10.37236/980

Cité par Sources :