Abstract
The strong direct product is one of several standard product operators on graphs. Dörfler and Imrich (1969) and, independently, McKenzie (1971) showed that any connected graph has a unique prime factorization under the strong direct product. We give a polynomial-time algorithm for finding this unique factorization, thus settling a question of Nešetřil.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.