Geodesic
Factoring directed graphs with respect to the cardinal product in polynomial time
Discussiones Mathematicae. Graph Theory, Tome 27 (2007) no. 3, pp. 593-601

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

By a result of McKenzie [4] finite directed graphs that satisfy certain connectivity and thinness conditions have the unique prime factorization property with respect to the cardinal product. We show that this property still holds under weaker connectivity and stronger thinness conditions. Furthermore, for such graphs the factorization can be determined in polynomial time.
Keywords: directed graphs, cardinal product, graph algorithms 
@article{DMGT_2007_27_3_a16,
     author = {Imrich, Wilfried and Kl\"ockl, Werner},
     title = {Factoring directed graphs with respect to the cardinal product in polynomial time},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {593--601},
     publisher = {mathdoc},
     volume = {27},
     number = {3},
     year = {2007},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2007_27_3_a16/}
}
TY  - JOUR
AU  - Imrich, Wilfried
AU  - Klöckl, Werner
TI  - Factoring directed graphs with respect to the cardinal product in polynomial time
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2007
SP  - 593
EP  - 601
VL  - 27
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2007_27_3_a16/
LA  - en
ID  - DMGT_2007_27_3_a16
ER  - 
%0 Journal Article
%A Imrich, Wilfried
%A Klöckl, Werner
%T Factoring directed graphs with respect to the cardinal product in polynomial time
%J Discussiones Mathematicae. Graph Theory
%D 2007
%P 593-601
%V 27
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2007_27_3_a16/
%G en
%F DMGT_2007_27_3_a16
Imrich, Wilfried; Klöckl, Werner. Factoring directed graphs with respect to the cardinal product in polynomial time. Discussiones Mathematicae. Graph Theory, Tome 27 (2007) no. 3, pp. 593-601. http://geodesic.mathdoc.fr/item/DMGT_2007_27_3_a16/