scientific article; zbMATH DE number 3309924
From MaRDI portal
Publication:5590666
Cited in
(18)- Approximate graph products
- Factoring cardinal product graphs in polynomial time
- The connectivities of locally finite primitive graphs
- Connectivity of strong products of graphs
- A method for obtaining refinement theorems, with an application to direct products of semigroups
- Strong products of hypergraphs: unique prime factorization theorems and algorithms
- Cancellation properties of products of graphs
- Über das lexikographische und das kostarke Produkt von Mengensystemen. (On the lexicographic and the costrong product of set systems)
- On recognition of strong graph bundles
- A bibliography of graph equations
- On the Cartesian skeleton and the factorization of the strong product of digraphs
- A local prime factor decomposition algorithm
- scientific article; zbMATH DE number 2230259 (Why is no real title available?)
- Counterexamples to two conjectures about distance sequences
- Finding the prime factors of strong direct product graphs in polynomial time
- Retracts of strong products of graphs
- Monoid algebras and graph products
- Weak reconstruction of strong product graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5590666)
