This is a preview of subscription content, log in via an institution to check access.
Literature Cited
O. Ore, Theory of Graphs., American Mathematical Society, Providence, Rhode Island (1962).
F. Harary and E. M. Palmer, Graphical Numeration, Academic Press (1973).
E. A. Dinits and M. A. Zaitsev, “Algorithms of generating nonisomorphic trees,” Avtomat. Telemekh., No. 4 (1977).
E. A. Dinits and M. A. Zaitsev, “Linear ordering and the generation of trees,” in: Algorithm Research in Combinative Analysis [in Russian], Nauka, Moscow (1978).
E. A. Dinits (Dinic), A. K. Kel'mans (Kelmans), and M. A. Zaitsev, “Nonisomorphic trees with the same T-polynomial,” Inf. Proc. Lett., No. 6 (1977).
H. J. Scoins, “Placing trees in lexicographic order,” Machine Intelligence, No. 3 (1968).
V. L. Arlazarov, I. I. Zuev, A. V. Uskov, and I. A. Faradzhev, “An algorithm of reducing finite nonoriented graphs to canonical form,” Zh. Vychisl. Mat. Mat. Fiz.,14, No. 3 (1974).
E. A. Dinits, A. V. Karzanov, and M. V. Lomonosov, “The structure of a system of minimal arm profiles of a graph,” in: Research on Discrete Optimization [in Russian], Nauka, Moscow (1976).
A. K. Kel'mans, “On the selection of the optimal apex in a graph,” in: Research on Discrete Mathematics [in Russian], Nauka, Moscow (1973).
Additional information
Translated from Kibernetika, No. 2, pp. 120–124, March–April, 1978.
Rights and permissions
About this article
Cite this article
Zaitsev, M.A. Canonical form and the linear ordering of certain treelike graphs. Cybern Syst Anal 14, 277–281 (1978). https://doi.org/10.1007/BF01069365
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01069365