On the graph structure of convex polyhedra in n-space
作者： Michel Balinski
关键词:
摘要:
sci-hub.st 参考文章(4)
George Bernard Dantzig, D. R. Fulkerson, On the Max Flow Min Cut Theorem of Networks. RAND Corporation. ,(1955)
W. T. Tutte, On Hamiltonian Circuits Journal of the London Mathematical Society. ,vol. s1-21, pp. 98- 101 ,(1946) , 10.1112/JLMS/S1-21.2.98
L. R. Ford, D. R. Fulkerson, Maximal Flow Through a Network Canadian Journal of Mathematics. ,vol. 8, pp. 243- 248 ,(1956) , 10.1007/978-0-8176-4842-8_15
Hassler Whitney, Congruent Graphs and the Connectivity of Graphs Hassler Whitney Collected Papers. ,vol. 54, pp. 61- 79 ,(1992) , 10.1007/978-1-4612-2972-8_4