@article{oai:niigata-u.repo.nii.ac.jp:00030242,
author = {仙石, 正和 and 黒部, 貞一 and 小川, 吉彦 and 松本, 正},
journal = {北海道大学工学部研究報告, 北海道大学工学部研究報告},
month = {Jun},
note = {Topological formulas of the computation of network functions are expressed in terms of a set of trees, cotrees, k trees, co-k trees, k cotrees and co-k cotrees in the corresponding graph. In this paper, hybrid k trees and hybrid k^^- trees in a graph which are the generalized concepts of k trees and co-k trees and k cotrees alla co-k cotrees, respectively are defined. And relationships among hybrid trees, hybrid 2 trees, hybrid 2^^- trees, circuits, cutsets, paths and sub-cutsets in a graph are presented. These results (using hybrid k trees and hybrid k^^- trees) may be considered as a generalization and an extension of work using subgraphs such as trees, cotrees, k trees and co-k trees etc.},
pages = {89--99},
title = {混成k木集合，混成k^^-木集合とその性質（I）},
volume = {67},
year = {1973}
}