graphs, networks and algorithms 4th ed - d jungnickel (springer, 2013) ww

graphs, networks and algorithms 4th ed. - d. jungnickel (springer, 2013) ww

graphs, networks and algorithms 4th ed. - d. jungnickel (springer, 2013) ww

... the two vertices of odd degree as start and end vertices. Let k = 1 and name the two vertices of odd degree a and b. By adding an (additional) edge ab to G, we get a connected multigraph H whose ... appeared. 1 See [Wil86 ]and[ BigLW76]. D. Jungnickel, Graphs, Networks and Algorithms, Algorithms and Computation in Mathematics 5, DOI 10.1007/97 8-3 -6 4 2-3 227 8-5 1...

Ngày tải lên: 03/05/2014, 18:31

677 1,2K 0
w