Exponents of two-colored digraphs
Czechoslovak Mathematical Journal, Tome 59 (2009) no. 3, pp. 655-685
Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
We consider the primitive two-colored digraphs whose uncolored digraph has $n+s$ vertices and consists of one $n$-cycle and one $(n-3)$-cycle. We give bounds on the exponents and characterizations of extremal two-colored digraphs.
@article{CMJ_2009__59_3_a8,
author = {Shao, Yanling and Gao, Yubin},
title = {Exponents of two-colored digraphs},
journal = {Czechoslovak Mathematical Journal},
pages = {655--685},
publisher = {mathdoc},
volume = {59},
number = {3},
year = {2009},
mrnumber = {2545648},
zbl = {1224.15020},
language = {en},
url = {http://geodesic.mathdoc.fr/item/CMJ_2009__59_3_a8/}
}
Shao, Yanling; Gao, Yubin. Exponents of two-colored digraphs. Czechoslovak Mathematical Journal, Tome 59 (2009) no. 3, pp. 655-685. http://geodesic.mathdoc.fr/item/CMJ_2009__59_3_a8/