On subgraphs of Cartesian product graphs

DOI10.1016/S0012-365X(01)00085-1zbMath0997.05085OpenAlexW2056245884MaRDI QIDQ1349090

Sandi Klavžar, Alenka Lipovec, Marko Petkovsek

Publication date: 21 May 2002

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00085-1

zbMATH Keywords

coloringCartesian product graphsgraph product\(S\)-prime graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (7)

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 ⋮ On subgraphs of Cartesian product graphs and S-primeness ⋮ Unnamed Item ⋮ Characterizing flag graphs and incuced subgraphs of Cartesian product graphs

This page was built for publication: On subgraphs of Cartesian product graphs