Graph multiplication
From MaRDI portal
Publication:772606
DOI10.1007/BF01162967zbMath0093.37603WikidataQ56688311 ScholiaQ56688311MaRDI QIDQ772606
Publication date: 1960
Published in: Mathematische Zeitschrift (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/183624
Related Items
Factoring cartesian‐product graphs, PRODUCTS OF CIRCULANT GRAPHS, Computing equivalence classes among the edges of a graph with applications, Finding the prime factors of strong direct product graphs in polynomial time, A note on Winkler's algorithm for factoring a connected graph, Prefibers and the cartesian product of metric spaces, Cartesian graph factorization at logarithmic cost per edge, Operations on fuzzy graphs, Recognizing Cartesian graph bundles, Characterization of products of trees and grids, A fixed box theorem for the cartesian product of graphs and metric spaces, Constructing status injective graphs, Retracts of infinite Hamming graphs, Factoring cardinal product graphs in polynomial time, On the weak reconstruction of Cartesian-product graphs, Lattices arising in categorial investigations of Hedetniemi's conjecture, Unnamed Item