Cardinal multiplication of structures with a reflexive relation
From MaRDI portal
Publication:5635486
DOI10.4064/fm-70-1-59-101zbMath0228.08002OpenAlexW1429713103MaRDI QIDQ5635486
Publication date: 1971
Published in: Fundamenta Mathematicae (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/214311
Related Items
A prime factor theorem for bipartite graphs, On a cancellation rule for subdirect products of lattice ordered groups and of GMV-algebras, Weak reconstruction of strong product graphs, Unnamed Item, Formations of finite monounary algebras, Best match graphs, Unnamed Item, Does the endomorphism poset $P^P$ determine whether a finite poset $P$ is connected? An issue Duffus raised in 1978, Exact-2-relation graphs, Connectivity of strong products of graphs, Strong products of hypergraphs: unique prime factorization theorems and algorithms, On the Cartesian skeleton and the factorization of the strong product of digraphs, Cancellation properties of products of graphs, Finding the prime factors of strong direct product graphs in polynomial time, Retracts of strong products of graphs, Vertex-transitive direct products of graphs, A local prime factor decomposition algorithm, A method for obtaining refinement theorems, with an application to direct products of semigroups, Powers of ordered sets, A bibliography of graph equations, Associative products of graphs, On the extension of vertex maps to graph homomorphisms, Asymmetric colorings of products of graphs and digraphs, Distinguishing index of Kronecker product of two graphs, Reciprocal best match graphs, Varieties having Boolean factor congruences, Combinatorial properties of products of graphs, Approximate graph products, On direct product cancellation of graphs, On the cancellation law among finite relational structures, Über das lexikographische und das kostarke Produkt von Mengensystemen. (On the lexicographic and the costrong product of set systems), Unnamed Item, Characterizing \(r\)-perfect codes in direct products of two and three cycles, Digraphs Products, Factoring cardinal product graphs in polynomial time, Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs
