Abstract
We present a polynomial-time algorithm to find out whether all directed cycles in a directed planar graph are of lengthpmodq, with 0≤p<q.
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
