A new algorithm is presented for detecting graph monomorphisms for a pair of graphs. This algorithm entails a tree search based on the projections of the product graph called the net of the two graphs. It uses the minimum number of neighbors of the projected graphs to detect infeasible subtrees. The algorithm, in comparison with that of Deo and coworkersâ€¦Â (More)