A new concept of primeness in graphs

DOI10.1002/net.3230110306zbMath0468.05063OpenAlexW2078959661MaRDI QIDQ3921275

Roger H. Lamprey, Bruce H. Barnes

Publication date: 1981

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230110306

zbMATH Keywords

Cartesian product of graphsplotting of graphsquasi-prime graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Related Items

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

Cites Work

• Boolean Operations on Graphs.