Diagonalized Cartesian products of S-prime graphs are S-prime
From MaRDI portal
(Redirected from Publication:658020)
Diagonalized Cartesian products of \(S\)-prime graphs are \(S\)-prime
Diagonalized Cartesian products of \(S\)-prime graphs are \(S\)-prime
Recommendations
Cites work
- scientific article; zbMATH DE number 1185296 (Why is no real title available?)
- scientific article; zbMATH DE number 3482390 (Why is no real title available?)
- scientific article; zbMATH DE number 1550912 (Why is no real title available?)
- A local prime factor decomposition algorithm
- A new concept of primeness in graphs
- Characterizing subgraphs of Hamming graphs
- On subgraphs of Cartesian product graphs
- On subgraphs of Cartesian product graphs and S-primeness
- Topics in graph theory. Graphs and their Cartesian product
Cited in
(7)- Fast factorization of Cartesian products of (directed) hypergraphs
- On the complexity of recognizing \(S\)-composite and \(S\)-prime graphs
- Strong products of hypergraphs: unique prime factorization theorems and algorithms
- A local prime factor decomposition algorithm
- On subgraphs of Cartesian product graphs
- On subgraphs of Cartesian product graphs and S-primeness
- On subgraphs of Cartesian product graphs and S-primeness
This page was built for publication: Diagonalized Cartesian products of \(S\)-prime graphs are \(S\)-prime
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q658020)