Diagonalized Cartesian products of \(S\)-prime graphs are \(S\)-prime
From MaRDI portal
Publication:658020
DOI10.1016/j.disc.2011.03.033zbMath1232.05197WikidataQ56990570 ScholiaQ56990570MaRDI QIDQ658020
Lydia Ostermeier, Peter F. Stadler, Marc Hellmuth
Publication date: 11 January 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.03.033
05C76: Graph operations (line graphs, products, etc.)
Related Items
A local prime factor decomposition algorithm, 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
Cites Work