Factoring cardinal product graphs in polynomial time

26Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.

Abstract

In this paper a polynomial algorithm for the prime factorization of finite, connected nonbipartite graphs with respect to the cardinal product is presented. This algorithm also decomposes finite, connected graphs into their prime factors with respect to the strong product and provides the basis for a new proof of the uniqueness of the prime factorization of finite, connected nonbipartite graphs with respect to the cardinal product. Furthermore, some of the consequences of these results and several open problems are discussed. © 1998 Elsevier Science B.V. All rights reserved.

Cite

CITATION STYLE

APA

Imrich, W. (1998). Factoring cardinal product graphs in polynomial time. Discrete Mathematics, 192(1–3), 119–144. https://doi.org/10.1016/S0012-365X(98)00069-7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free