### On the graph structure of convex polyhedra in $n$-space.

M. L. Balinski
Source: Pacific J. Math. Volume 11, Number 2 (1961), 431-434.
First Page:
Primary Subjects: 52.10
Secondary Subjects: 90.10
Full-text: Open access

Permanent link to this document: http://projecteuclid.org/euclid.pjm/1103037323
Zentralblatt MATH identifier: 0103.39602
Mathematical Reviews number (MathSciNet): MR0126765

### References

[1] Michel L. Balinski, An Algorithm for Finding all Vertices of Convex Polyhedral Sets, doctoral dissertation, Princeton Universty, June, 1959. J. Soc. Indust. Applied Math., 9 (1961), 72-88.
Mathematical Reviews (MathSciNet): MR25:5451
Zentralblatt MATH: 0108.33203
[2] T. A. Brown, HamiltonianPaths on Convex Polyhera, unpublished note, The RAND Corporation, August 1960, (included while in press).
[3] G. B. Dantzig and D. R. Fulkerson, On the Max-Flow Min-Cut Theorem ofNetworks, paper 12 of Liner Inequalities and Related Systems, H. W. Kuhn and A. W. Tucker (eds.) Annals of Mathematics No. 38, Princeton University Press, Princeton, N.J., 1956.
Mathematical Reviews (MathSciNet): MR18:536h
Zentralblatt MATH: 0072.37802
[4] G. A. Dirac, Some theorems of abstract graphs, Proc. London Math. Soc, Series 3, Vol. II (1952), 69-81.
Mathematical Reviews (MathSciNet): MR13:856e
Zentralblatt MATH: 0047.17001
[5] L. R. Ford, Jr. and D. R. Fulkerson, Maximal flow through a network, Canadian Math., 8 (1956), 399-404.
Mathematical Reviews (MathSciNet): MR18:56h
Zentralblatt MATH: 0073.40203
[6] A. W. Tucker, Linear Inequalities and Convex Polyhedral Sets, Proceedings of the Second Symposium in Linear Programming, Bureau of Standards, Washington, D. C, January 27-29, 1955, pp. 569-602.
Mathematical Reviews (MathSciNet): MR17:778c
[7] W. T. Tutte, On Hamiltonian circuits, Journal London Math. Soc, 21 (1946), 98-101.
Mathematical Reviews (MathSciNet): MR8:397d
Zentralblatt MATH: 0061.41306
[8] Hassler Whitney, Congruent graphs and the connectivity of graphs, Amer. J. Math., 54 (1932), 150-168.
Zentralblatt MATH: 0003.32804