Abstract
In this paper we enlighten the structure of dipaths of prescribed parity in planar digraphs and we present a polynomial time algorithm for solving the following problem given a planar digraph G and a face F of G such that G – F has no even dicycle, find a dipath of prescribed parity between two specified vertices of F The same algorithm can be recursively applied to provide a polynomial time procedure for finding even dicycles in G (if any).
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.
