Abstract
We present a polynomial-time algorithm for deciding whether a given connected graph is a non-trivial Cartesian product. The method entails first representing the graph as an isometric subgraph of a Cartesian product of graphs, then finding a suitable partition of the factors.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
