Abstract
Given an undirected graph G and four distinct vertices s 1 ,t 1 ,s 2 and t 2 , the two paths problem is to determine whether there exist two vertex-disjoint paths connecting s 1 with t 1 and s 2 with t 2 and to find such paths if they do exist. A very simple proof for undirected planar graphs is presented.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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
