1. Tucker, A. W., Combinatorial theory underlying linear programs, In: R. E. Graves and P. Wolfe, eds., Recent Advances in Mathematical Programming, McGraw-Hill, New York, 1963, 1–16.
2. Holzmann, C. A. and Harary, F., On the tree graph of a matroid, SIAM J. Appl. Math., 1972, 22: 187–193.
3. Maurer, S. B., Matroid basis graphs (I) (I), J. Combinatorial Theory, Ser. B, 1973, 14: 216–240; 15: 121–145.
4. Lawler, E. L., Combinatorial Optimization: Netowrks and Matroids, Holt, Rinchart and Winston, New York, 1976.
5. Gal, T., Kruse, H. J. and Zornig, P., Survey of solved and open problems in the degeneracy phenomenon, Mathematical Programming 1988, 42: 125–133.