Abstract
A P3→-decomposition of a directed graph D is a partition of the arcs of D into directed paths of length 2. We characterize symmetric digraphs that do not admit a P3→-decomposition. We show that the only 2-regular, connected directed graphs that do not admit a P3→-decomposition are obtained from undirected odd cycles by replacing each edge by two oppositely directed arcs. In both cases, we give a linear-time algorithm to find a P3→-decomposition, if it exists.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
