Geodesic
Cycle-pancyclism in bipartite tournaments I
Discussiones Mathematicae. Graph Theory, Tome 24 (2004) no. 2, pp. 277-290

Voir la notice de l'article provenant de la source Library of Science

Let T be a hamiltonian bipartite tournament with n vertices, γ a hamiltonian directed cycle of T, and k an even number. In this paper, the following question is studied: What is the maximum intersection with γ of a directed cycle of length k? It is proved that for an even k in the range 4 ≤ k ≤ [(n+4)/2], there exists a directed cycle C_h(k) of length h(k), h(k) ∈ k,k-2 with |A(C_h(k)) ∩ A(γ)| ≥ h(k)-3 and the result is best possible.
Keywords: bipartite tournament, pancyclism 
@article{DMGT_2004_24_2_a9,
     author = {Galeana-S\'anchez, Hortensia},
     title = {Cycle-pancyclism in bipartite tournaments {I}},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {277--290},
     publisher = {mathdoc},
     volume = {24},
     number = {2},
     year = {2004},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2004_24_2_a9/}
}
TY  - JOUR
AU  - Galeana-Sánchez, Hortensia
TI  - Cycle-pancyclism in bipartite tournaments I
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2004
SP  - 277
EP  - 290
VL  - 24
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2004_24_2_a9/
LA  - en
ID  - DMGT_2004_24_2_a9
ER  - 
%0 Journal Article
%A Galeana-Sánchez, Hortensia
%T Cycle-pancyclism in bipartite tournaments I
%J Discussiones Mathematicae. Graph Theory
%D 2004
%P 277-290
%V 24
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2004_24_2_a9/
%G en
%F DMGT_2004_24_2_a9
Galeana-Sánchez, Hortensia. Cycle-pancyclism in bipartite tournaments I. Discussiones Mathematicae. Graph Theory, Tome 24 (2004) no. 2, pp. 277-290. http://geodesic.mathdoc.fr/item/DMGT_2004_24_2_a9/