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