@article{oai:repository.lib.tottori-u.ac.jp:00001424,
 author = {加藤, 明史 and Kato, Akinobu},
 issue = {1},
 journal = {鳥取大学教育学部研究報告. 自然科学, The Journal of the Faculty of Education, Tottori University. Natural science},
 month = {Jun},
 note = {LANDAU proved that the distance from a point with maximum outdegree to any other point is 1 or 2 in a directed complete graph G. Nevertheless, the converse of this theorem does not hold. Namely, even if the distance from a point e of G to any other point is 1 or 2, the point e has not always the maximum outdegree. Then, in this article, extending the theorem of LANDAU, we call a point e of G a "maximum point" of G if the distance from e to any other point is 1 or 2, and we denote by max G the set of all maximum points of G. The propose of this article is to study some properties of the set max G and of spanning paths of a directed complete graph G. This article is based on my paper [4] that is polished and improved.},
 pages = {1--6},
 title = {有向完全グラフの極大点と生成通路},
 volume = {24},
 year = {1973},
 yomi = {カトウ, アキノブ and カトウ, アキノブ}
}