ON FINDING SIMPLE PATHS AND CIRCUITS IN A GRAPH

[1] COMPUTER RECOGNITION AND EXTRACTION OF PLANAR GRAPHS FROM INCIDENCE MATRIX [J]. IEEE TRANSACTIONS ON CIRCUIT THEORY, 1966, CT13 (02): : 154 - &

[2] ALL PATHS THROUGH A MAZE [J]. PROCEEDINGS OF THE INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS, 1967, 55 (01): : 88 - &

[3] ORE O, 1962, THEORY GRAPHYS, V38

[4] PATHFINDING THROUGH A COMMUNICATION NETWORK [J]. PROCEEDINGS OF THE INSTITUTION OF ELECTRICAL ENGINEERS-LONDON, 1967, 114 (01): : 76 - &

[5] PONSTEIN J, 1966, J SIAM APPL MATH, P600

[6] GENERATION OF ALL HAMILTONIAN CIRCUITS PATHS AND CENTERS OF A GRAPH AND RELATED PROBLEMS [J]. IEEE TRANSACTIONS ON CIRCUIT THEORY, 1967, CT14 (01): : 79 - &

[1] COMPUTER RECOGNITION AND EXTRACTION OF PLANAR GRAPHS FROM INCIDENCE MATRIX [J]. IEEE TRANSACTIONS ON CIRCUIT THEORY, 1966, CT13 (02): : 154 - &

[2] ALL PATHS THROUGH A MAZE [J]. PROCEEDINGS OF THE INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS, 1967, 55 (01): : 88 - &

[3] ORE O, 1962, THEORY GRAPHYS, V38

[4] PATHFINDING THROUGH A COMMUNICATION NETWORK [J]. PROCEEDINGS OF THE INSTITUTION OF ELECTRICAL ENGINEERS-LONDON, 1967, 114 (01): : 76 - &

[5] PONSTEIN J, 1966, J SIAM APPL MATH, P600

[6] GENERATION OF ALL HAMILTONIAN CIRCUITS PATHS AND CENTERS OF A GRAPH AND RELATED PROBLEMS [J]. IEEE TRANSACTIONS ON CIRCUIT THEORY, 1967, CT14 (01): : 79 - &