Cardinal multiplication of structures with a reflexive relation
From MaRDI portal
Publication:5635486
Cited in
(37)- A bibliography of graph equations
- Connectivity of strong products of graphs
- On recognition of strong graph bundles
- On direct product cancellation of graphs
- Strong products of hypergraphs: unique prime factorization theorems and algorithms
- On the cancellation law among finite relational structures
- Digraphs products
- scientific article; zbMATH DE number 3598526 (Why is no real title available?)
- A local prime factor decomposition algorithm
- A prime factor theorem for bipartite graphs
- Exact-2-relation graphs
- Asymmetric colorings of products of graphs and digraphs
- Reciprocal best match graphs
- Cancellation properties of products of graphs
- Retracts of strong products of graphs
- A method for obtaining refinement theorems, with an application to direct products of semigroups
- Weak reconstruction of strong product graphs
- Approximate graph products
- Factoring cardinal product graphs in polynomial time
- Powers of ordered sets
- Distinguishing index of Kronecker product of two graphs
- Associative products of graphs
- Does the endomorphism poset $P^P$ determine whether a finite poset $P$ is connected? An issue Duffus raised in 1978
- Finding the prime factors of strong direct product graphs in polynomial time
- On the extension of vertex maps to graph homomorphisms
- Combinatorial properties of products of graphs
- Characterizing \(r\)-perfect codes in direct products of two and three cycles
- On a cancellation rule for subdirect products of lattice ordered groups and of GMV-algebras
- On the Cartesian skeleton and the factorization of the strong product of digraphs
- scientific article; zbMATH DE number 2230259 (Why is no real title available?)
- Taylor is prime
- Vertex-transitive direct 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
- Formations of finite monounary algebras
- Best match graphs
- Fine-grained complexity of the graph homomorphism problem for bounded-treewidth graphs
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)