Factoring cardinal product graphs in polynomial time
type: Item
instance of: scholarly article
title: Factoring cardinal product graphs in polynomial time
zbMATH Open document ID: 0955.68089
DOI: 10.1016/S0012-365X(98)00069-7
author: Wilfried Imrich
published in: Discrete Mathematics
publication date: 2000-11-02T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1525016
zbMATH Keywords: polynomial algorithm
zbMATH Keywords: connected nonbipartite graphs
MaRDI profile type: Publication
cites work: Cartesian graph factorization at logarithmic cost per edge
cites work: Q4063492
cites work: Q4770422
cites work: Q5590666
cites work: Product graph representations
cites work: A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
cites work: Finding the prime factors of strong direct product graphs in polynomial time
cites work: On Isometric Embeddings of Graphs
cites work: On a Problem of G. Birkhoff
cites work: Q5574690
cites work: Über das schwache Kartesische Produkt von Graphen
cites work: Q5655386
cites work: Q4294601
cites work: Associative products of graphs
cites work: On the complexity of recognizing Hamming graphs and related classes of graphs
cites work: Q3990238
cites work: On the weak reconstruction of Cartesian-product graphs
cites work: Isomorphic components of Kronecker product of bipartite graphs
cites work: Cardinal multiplication of structures with a reflexive relation
cites work: The Categorical Product of Graphs
cites work: The Automorphism Group of a Product of Graphs
cites work: Graph multiplication
cites work: Metric Spaces and Positive Definite Functions
cites work: The Kronecker Product of Graphs
cites work: Factoring a graph in polynomial time
cites work: Minimum dimension embedding of finite metric spaces
description: scientific article; zbMATH DE number 1525016