Article thumbnail

Factoring cardinal product graphs in polynomial time

By Wilfried Imrich

Abstract

AbstractIn 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

Publisher: Published by Elsevier B.V.
Year: 1998
DOI identifier: 10.1016/S0012-365X(98)00069-7
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://s3.amazonaws.com/prod-... (external link)
  • https://s3-eu-west-1.amazonaws... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.