@article{oai:niigata-u.repo.nii.ac.jp:00030244,
 author = {仙石, 正和},
 journal = {北海道大学工学部研究報告, 北海道大学工学部研究報告},
 month = {Dec},
 note = {In graph theory, a tree or a cotree is an important concept not only for the sake of its applications to many different fields, but also to graph theory itself. A hybrid tree in a linear graph is a generalized concept of a tree and a cotree. And thus, to examine the properties of hybrid trees seems to be of considerable importance. In this paper, a set of hybrid trees in a linear graph is classified according to the number of edges in the element of it, and a hybrid tree graph is defined as a linear graph which represents the relations among the elements of the set of hybrid trees. And it is shown that a hybrid tree graph is balanced. Using this property, the relationships between the above classification of a set of hybrid trees and the structure of the hybrid tree graph are presented. These results are useful in the realization of a hybrid tree graph.},
 pages = {81--86},
 title = {混成木グラフとその均衡性},
 volume = {65},
 year = {1972}
}