Patil, H. P. (1986), On the structure of k-trees, Journal of Combinatorics, Information and System Sciences, 11 (2-4): 57—64, MR0966069
Koch, Etan; Perles, Micha A. (1976), Covering efficiency of trees and k-trees, Proceedings of the Seventh Southeastern Conference on Combinatorics, Graph Theory, and Computing (Louisiana State Univ., Baton Rouge, La., 1976), Utilitas Math., Winnipeg, Man., с. 391–420. Congressus Numerantium, No. XVII, MR0457265. Див. стор. 420.
Kleinschmidt, Peter (1 грудня 1976). Eine graphentheoretische Kennzeichnung der Stapelpolytope. Archiv der Mathematik. 27 (1): 663—667. doi:10.1007/BF01224736.
gatech.edu
people.math.gatech.edu
Thomas Fowler. Unique Coloring of Planar Graphs. — Georgia Institute of Technology Mathematics Department, 1998. — (Ph.D. thesis)