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.
@article{bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1385,
author = {Wilfried Imrich and Werner Kl\"ockl},
title = {Factoring directed graphs with respect to the cardinal product in polynomial time},
journal = {Discussiones Mathematicae Graph Theory},
volume = {27},
year = {2007},
pages = {593-601},
zbl = {1142.05039},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1385}
}
Wilfried Imrich; Werner Klöckl. Factoring directed graphs with respect to the cardinal product in polynomial time. Discussiones Mathematicae Graph Theory, Tome 27 (2007) pp. 593-601. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1385/
[000] [1] J. Feigenbaum and A.A. Schäffer, Finding the prime factors of strong direct product graphs in polynomial time, Discrete Math. 109 (1992) 77-102, doi: 10.1016/0012-365X(92)90280-S. | Zbl 0786.68076
[001] [2] W. Imrich, Factoring cardinal product graphs in polynomial time, Discrete Math. 192 (1998) 119-144, doi: 10.1016/S0012-365X(98)00069-7. | Zbl 0955.68089
[002] [3] W. Imrich and S. Klavžar, Product Graphs, Wiley-Interscience Series in Discrete Mathematics and Optimization (Wiley-Interscience, New York, 2000), Structure and recognition, With a foreword by Peter Winkler.
[003] [4] R. McKenzie, Cardinal multiplication of structures with a reflexive relation, Fund. Math. 70 (1971) 59-101. | Zbl 0228.08002