... The shortest path through a maze, Proc. Int. Symp. on the Theory ofSwitching, Path II, 285 (1957).[46] Murchland J. D., A new method for finding all elementary paths in a complete directed graph, ... T., How to draw graph, Proc. London Math. Soc., Ser. 3, Vol. 13, 743-768(1963).[55] Whitney H. , 2−Isomorphic graphs, Am. J. Math. Vol. 55 245-254 (1933).212http://www.ebook.edu.vn/****** Phan ... Applied Mathematics, 16, 87 (1958).[4] Berge C., L´y thuyˆe´t d¯ˆo`thi.v`a ´u.ng du.ng, NXB Khoa ho.c v`a K˜y thuˆa.t H` a Nˆo.i, 1971.[5] Berge C., Two theorems in graph theory,...