Kyoto University Research Information Repository: 検索

DSpace

Kyoto University

検索

検索結果表示: 1-10 / 15.

前
1
2
次

検索結果:

書誌情報	ファイル
Uniformly Finite-to-One and Onto Extensions of Homomorphisms between Directed Graphs (Graphs and Combinatorics III) NASU, MASAKAZU (1980-09) 数理解析研究所講究録, 397: 206-229
(1,0,x)-Representation of a Graph (Graphs and Combinatorics III) KAJITANI, YOJI (1980-09) 数理解析研究所講究録, 397: 230-233
Adventures with Ramsey Theory (Graphs and Combinatorics III) HARARY, FRANK (1980-09) 数理解析研究所講究録, 397: 234-248
An Approximation Algorithm for the Hamiltonian Walk Problem on Maximal Planar Graphs (Graphs and Combinatorics III) NISHIZEKI, TAKAO; ASANO, TAKAO; WATANABE, TAKAHIRO (1980-09) 数理解析研究所講究録, 397: 156-178
On the Decomposition of a Directed Graph with Respect to Arborescences and Related Problems (Graphs and Combinatorics III) NAKAMURA, MASATAKA; IRI, MASAO (1980-09) 数理解析研究所講究録, 397: 104-118
Analysis of the Command Flow Numbers I : Boolean Lattices (Graphs and Combinatorics III) NARUSHIMA, HIROSHI (1980-09) 数理解析研究所講究録, 397: 179-186
Theory and Applications of Principal Partitions of Matroids (Graphs and Combinatorics III) IRI, MASAO (1980-09) 数理解析研究所講究録, 397: 119-155
A Few Properties of Clique Graphs (Graphs and Combinatorics III) SATO, IWAO (1980-09) 数理解析研究所講究録, 397: 187-205
Graph Theoretical & Computational Problems in Structures & Rearrangement Reactions of Polycyclichydrocarbons (Graphs and Combinatorics III) KAN, T.; TANAKA, N.; MIURA, H.; IIZUKA, T. (1980-09) 数理解析研究所講究録, 397: 16-29
How to Rank the Vertices in a Paired Comparison Digraph (Graphs and Combinatorics III) KANO, MIKIO; SAKAMOTO, AKIO (1980-09) 数理解析研究所講究録, 397: 9-15