Geodesic
On the toughness of cycle permutation graphs
Czechoslovak Mathematical Journal, Tome 51 (2001) no. 2, pp. 239-260

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

Motivated by the conjectures in [11], we introduce the maximal chains of a cycle permutation graph, and we use the properties of maximal chains to establish the upper bounds for the toughness of cycle permutation graphs. Our results confirm two conjectures in [11].
Classification : 05C40, 05C58
Keywords: cycle permutation graph; toughness; maximal chain 
@article{CMJ_2001__51_2_a2,
     author = {Chao, Chong-Yun and Han, Shaocen},
     title = {On the toughness of cycle permutation graphs},
     journal = {Czechoslovak Mathematical Journal},
     pages = {239--260},
     publisher = {mathdoc},
     volume = {51},
     number = {2},
     year = {2001},
     mrnumber = {1844308},
     zbl = {0977.05073},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/CMJ_2001__51_2_a2/}
}
TY  - JOUR
AU  - Chao, Chong-Yun
AU  - Han, Shaocen
TI  - On the toughness of cycle permutation graphs
JO  - Czechoslovak Mathematical Journal
PY  - 2001
SP  - 239
EP  - 260
VL  - 51
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/CMJ_2001__51_2_a2/
LA  - en
ID  - CMJ_2001__51_2_a2
ER  - 
%0 Journal Article
%A Chao, Chong-Yun
%A Han, Shaocen
%T On the toughness of cycle permutation graphs
%J Czechoslovak Mathematical Journal
%D 2001
%P 239-260
%V 51
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/CMJ_2001__51_2_a2/
%G en
%F CMJ_2001__51_2_a2
Chao, Chong-Yun; Han, Shaocen. On the toughness of cycle permutation graphs. Czechoslovak Mathematical Journal, Tome 51 (2001) no. 2, pp. 239-260. http://geodesic.mathdoc.fr/item/CMJ_2001__51_2_a2/