Rchr
J-GLOBAL ID:200901073526108405
Update date: Dec. 06, 2023
KIYOSHI ANDO
アンドウ キヨシ | KIYOSHI ANDO
Research keywords (8):
coding theory
, combinatorics
, graph theory
, discrete mathematics
, 符号理論
, 組合せ論
, グラフ理論
, 離散数学
Papers (66):
Kiyoshi Ando, Shinya Fujita, Ken-ichi Kawarabayashi. Minimally contraction-critically 6-connected graphs. DISCRETE MATHEMATICS. 2012. 312. 3. 671-679
Kiyoshi Ando, Takashi Iwase. The number of vertices of degree 5 in a contraction-critically 5-connected graph. DISCRETE MATHEMATICS. 2011. 311. 17. 1925-1939
Kiyoshi Ando, Qin Chengfu. Some structural properties of minimally contraction-critically 5-connected graphs. DISCRETE MATHEMATICS. 2011. 311. 13. 1084-1097
Kiyoshi Ando. Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph. DISCRETE MATHEMATICS. 2009. 309. 22. 6359-6367
Kiyoshi Ando. A Local Structure Theorem on 5-Connected Graphs. JOURNAL OF GRAPH THEORY. 2009. 60. 2. 99-129
more...
Books (3):
初等幾何学
森北出版株式会社 1994
数学辞典(James nad James Mathematics Dictionary)
朝倉書店 1993
組合せ論演習
東海大学出版会 1988
Lectures and oral presentations (16):
Contractible edges in k-connected graphs
(The China-Japan Joint Conference on Discrete Geometry, Combinatorics and Graph Theory 2005)
Every 7-contraction critical graph G has $|V(G)|/64$ vertices of degree 7
(2002日本数学会総会 2002)
Vertices of degree 7 in a 7-contraction critical graph
(応用数学合同研究集会報告集 2001)
Vertices of Degree 6 in a 6-contraction Critical Graph
(EuroConference on Combinatorics, Graph Theory and Applications 2001)
Minimally 5-contraction critical graphs
(2001日本数学会秋期総合分科会 2001)
more...
Education (2):
- 1973 The University of Electro-Communications Graduate School, Division of Electro Communications 物理工学専攻
- 1971 The University of Electro-Communications Faculty of Electro Communications 物理工学科
Professional career (2):
工学修士 (電気通信大学)
理学博士 (東京大学)
Committee career (1):
2002 - 2004 日本数学会 応用数学分科会委員
Association Membership(s) (2):
日本数学会
, 情報理論とその応用学会
※ Researcher’s information displayed in J-GLOBAL is based on the information registered in
researchmap
.
For details, see here
.
Return to Previous Page
TOP
BOTTOM