Diagonalized Cartesian products of \(S\)-prime graphs are \(S\)-prime

DOI10.1016/j.disc.2011.03.033zbMath1232.05197DBLPjournals/dm/HellmuthOS12OpenAlexW2012965298WikidataQ56990570 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

zbMATH Keywords

Cartesian product graphnontrivial path-\(k\)-coloring

Mathematics Subject Classification ID

Graph operations (line graphs, products, etc.) (05C76)

Related Items (4)

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

Cites Work

• A local prime factor decomposition algorithm
• On subgraphs of Cartesian product graphs
• On subgraphs of Cartesian product graphs and S-primeness
• A new concept of primeness in graphs
• Characterizing subgraphs of Hamming graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Diagonalized Cartesian products of \(S\)-prime graphs are \(S\)-prime