Generation of all Cutsets of a Bipath Network

An algorithm to find the Hamiltonian circuit in a bipath network is developed. Using the Hamiltonian circuit all cutsets of a bipath network are generated from incidence sets in a systematic way without duplication. Also it is shown that the algorithm to find the Hamiltonian circuit can be used to test a graph for bipathness.