30 citations · 32 across the 5 of their papers we have counts for
1 paper · 1 filter
Geoffrey Pearce, Cheryl E Praeger
A graph is Cartesian decomposable if it is isomorphic to a Cartesian product of (more than one) strictly smaller graphs, each of which has more than one vertex and admits no such d…