On subgraphs of Cartesian product graphs and S-primeness

DOI10.1016/j.disc.2003.11.005zbMath1042.05088OpenAlexW2125953308MaRDI QIDQ1827726

Boštjan Brešar

Publication date: 6 August 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2003.11.005

zbMATH Keywords

Cartesian productExtensionPrimeSubgraph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph theory (05C99)

Related Items (4)

Fast factorization of Cartesian products of (directed) hypergraphs ⋮ On the complexity of recognizing \(S\)-composite and \(S\)-prime graphs ⋮ Diagonalized Cartesian products of \(S\)-prime graphs are \(S\)-prime ⋮ A local prime factor decomposition algorithm

Cites Work

• On cubical graphs
• On subgraphs of Cartesian product graphs
• On Isometric Embeddings of Graphs
• A new concept of primeness in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On subgraphs of Cartesian product graphs and S-primeness