@article{oai:niigata-u.repo.nii.ac.jp:00030243,
author = {仙石, 正和},
journal = {北海道大学工学部研究報告, 北海道大学工学部研究報告},
month = {Mar},
note = {A hybrid tree on a linear graph is a generalized concept of a tree and a cotree. A hybrid tree graph is a linear graph which represents the relations among the elements of the set of hybrid trees. In this paper, some properties of a hybrid tree graph of a connected linear graph G are investigated. And an algorithm for finding a cut set matrix of the graph which realizes the given subgraph (the local subgraph) of a hybrid tree graph is presented. An interesting property of a hybrid tree graph HT_g of G, that is, HT_g is balanced, is used for classification of edges in G. These results show that only a local subgraph of the hybrid tree graph HT_g and the sign of edges of a tree on the subgraph are the sufficient knowledge for the realization of the set of hybrid trees.},
pages = {35--42},
title = {混成木グラフの実現について},
volume = {66},
year = {1973}
}