ANDO KIYOSHI

Emeritus Professor etc.Emeritus Professor
  • Profile:
    Study on discrete mathematics at the Department of Fundamental Sciences of Nippon Medical School.

    Study on graph theory, discrete mathematics, algebraic code theory at the University of Electro-Communications
Researcher Information

Degree

  • 工学修士, 電気通信大学
  • 理学博士, 東京大学

Research Keyword

  • coding theory
  • combinatorics
  • graph theory
  • discrete mathematics
  • 符号理論
  • 組合せ論
  • グラフ理論
  • 離散数学

Educational Background

  • Mar. 1973
    The University of Electro-Communications, Graduate School, Division of Electro Communications, 物理工学専攻
  • Mar. 1971
    The University of Electro-Communications, Faculty of Electro Communications, 物理工学科

Member History

  • 2002 - 2004
    応用数学分科会委員, 日本数学会, Society
Research Activity Information

Paper

  • Minimally contraction-critically 6-connected graphs
    Kiyoshi Ando; Shinya Fujita; Ken-ichi Kawarabayashi
    DISCRETE MATHEMATICS, 312, 3, 671-679, Feb. 2012, Peer-reviwed
    Scientific journal, English
    DOI URL
  • The number of vertices of degree 5 in a contraction-critically 5-connected graph
    Kiyoshi Ando; Takashi Iwase
    DISCRETE MATHEMATICS, 311, 17, 1925-1939, Sep. 2011, Peer-reviwed
    Scientific journal, English
    DOI URL
  • Some structural properties of minimally contraction-critically 5-connected graphs
    Kiyoshi Ando; Qin Chengfu
    DISCRETE MATHEMATICS, 311, 13, 1084-1097, Jul. 2011, Peer-reviwed
    Scientific journal, English
    DOI URL
  • Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph
    Kiyoshi Ando
    DISCRETE MATHEMATICS, 309, 22, 6359-6367, Nov. 2009, Peer-reviwed
    Scientific journal, English
    DOI URL
  • A Local Structure Theorem on 5-Connected Graphs
    Kiyoshi Ando
    JOURNAL OF GRAPH THEORY, 60, 2, 99-129, Feb. 2009, Peer-reviwed
    Scientific journal, English
    DOI URL
  • On the number of 4-contractible edges in 4-connected graphs
    K. Ando; Y. Egawa; K. Kawarabayashi; Matthias Kriesell
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 99, 1, 97-109, Jan. 2009, Peer-reviwed
    Scientific journal, English
    DOI URL
  • Edges not contained in triangles and the number of contractible edges in a 4-connected graph
    Kiyoshi Ando; Yoshimi Egawa
    DISCRETE MATHEMATICS, 308, 23, 5463-5472, Dec. 2008, Peer-reviwed
    Scientific journal, English
    DOI URL
  • Edges not contained in triangles and the distribution of contractible edges in a 4-connected graph
    Kiyoshi Ando; Yoshimi Egawa
    DISCRETE MATHEMATICS, 308, 16, 3449-3460, Aug. 2008, Peer-reviwed
    Scientific journal, English
    DOI URL
  • Contractible edges in minimally k-connected graphs
    Kiyoshi Ando; Atsushi Kaneko; Ken-ichi Kawarabayashi
    DISCRETE MATHEMATICS, 308, 4, 597-602, Feb. 2008, Peer-reviwed
    Scientific journal, English
    DOI URL
  • Minimum sets in an A_2-lattice whose component does not induce any equilateral triangle
    Kiyoshi Ando; Mamoru Watanabe
    The Bulletin of Kurasiki University of Science and the Arts, 12, 1, 105-112, Mar. 2007, Peer-reviwed
    Research institution, English
  • Contractible edges in a k-connected graph
    Kiyoshi Ando
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 4381, 10-20, 2007, Peer-reviwed
    International conference proceedings, English
    DOI URL
  • Contractible edges in a 4-connected graph with vertices of degree greater than four
    Kiyoshi Ando; Yoshimi Egawa
    GRAPHS AND COMBINATORICS, 23, 99-115, 2007, Peer-reviwed
    Scientific journal, English
    DOI URL
  • Contractible edges in a $k$-connected graph
    Ando, Kiyoshi
    Lecture Notes in Comput. Sci., 4381, 10--20, 2007, Peer-reviwed
    Scientific journal, English
    DOI URL
  • Tight quadrangulations on the sphere
    H Komuro; K Ando; A Nakamoto
    DISCRETE MATHEMATICS, 306, 2, 278-283, Feb. 2006, Peer-reviwed
    Scientific journal, English
    DOI URL
  • Trivially noncontractible edges in a contraction critically 5-connected graph
    K Ando
    DISCRETE MATHEMATICS, 293, 1-3, 61-72, Apr. 2005, Peer-reviwed
    Scientific journal, English
    DOI URL
  • Vertices of degree 5 in a contraction critically 5-connected graph
    K Ando; A Kaneko; K Kawarabayashi
    GRAPHS AND COMBINATORICS, 21, 1, 27-37, Mar. 2005, Peer-reviwed
    Scientific journal, English
    DOI URL
  • Vertices of degree 6 in a contraction critically 6-connected graph
    K Ando; A Kaneko; K Kawarabayashi
    DISCRETE MATHEMATICS, 273, 1-3, 55-69, Dec. 2003, Peer-reviwed
    Scientific journal, English
    DOI URL
  • Cycles having the same modularity and removable edges in 2-connected graphs
    K Ando; M Hagita; A Kaneko; M Kano; K Kawarabayashi; A Saito
    DISCRETE MATHEMATICS, 265, 1-3, 23-30, Apr. 2003, Peer-reviwed
    Scientific journal, English
    DOI URL
  • Maximum number of edges in a critically $k$-connected graph
    Kiyoshi Ando; Yoshimi Egawa
    Discrete Mathematics, 260, 1-3, 1--25, 2003, Peer-reviwed
    Scientific journal, English
  • Some forbidden subgraph conditions for a graph to have a k-contractible edge
    Kiyoshi Ando; Kenichi Kawrabayashi
    Discrete Mathematics, 297, 1-3, 3-11, 2003, Peer-reviwed
    Scientific journal, English
    DOI URL
  • Bandwidth of the cartesian product of two connected graphs
    T Kojima; K Ando
    DISCRETE MATHEMATICS, 252, 1-3, 227-235, May 2002, Peer-reviwed
    Scientific journal, English
    DOI URL
  • Path factors in claw-free graphs
    Kiyoshi Ando; Yoshimi Egawa; Atsushi Kaneko; Ken-ichi Kawarabayashi; Haruhide Matsuda
    Discrete Mathematics, 243, 1-3, 195--200, 2002, Peer-reviwed
    Scientific journal, English
    DOI URL
  • On quadrangulations of closed surfaces covered by vertices of degree 3
    Kiyoshi Ando; Atsuhiro Nakamoto
    Ars Combin., 62, 121--127, 2002, Peer-reviwed
    Scientific journal, English
  • Graph $G$ for which both $G$ and $\overline G$ are contraction critically $k$-connected
    Jin Akiyama; Kiyoshi Ando; Yoshimi Egawa
    Graphs Combin., 18, 4, 693--708, 2002, Peer-reviwed
    Scientific journal, English
    DOI URL
  • Self-complementary graphs with minimum degree two
    Kiyoshi Ando; Atsuhiro Nakamoto
    Ars Combin., 65, 65--74, 2002, Peer-reviwed
    Scientific journal, English
  • Edge-wide-diameter of graphs with diameter $d$
    Toru Kojima; Kiyoshi Ando; Atsushi Kaneko
    Ann. Comb., 6, 1, 57--64, 2002, Peer-reviwed
    Scientific journal, English
  • Diagonal flips of pseudo triangulations on the sphere
    H Komuro; K Ando
    ARS COMBINATORIA, 59, 225-239, Apr. 2001, Peer-reviwed
    Scientific journal, English
  • Minimum length of cycles through specified vertices in graphs with wide-diameter at most d
    T Kojima; K Ando
    ARS COMBINATORIA, 58, 245-256, Jan. 2001
    Scientific journal, English
  • Diagonal Transformations of Quadrangulations on the Sphere
    K. Ando; A. Nakamoto
    Japan Conference on Discrete and Computational Geometry '2000, Nov. 2000
    English
  • Some properties of 5-contraction critical graphs
    K. Ando; A. Kaneko; K. Kawarabayashi
    6th International Conference on Graph Theory（Marseille, France）, Aug. 2000
    English
  • Wide-diameter and minimum length of fan
    T Kojima; K Ando
    THEORETICAL COMPUTER SCIENCE, 235, 2, 257-266, Mar. 2000
    Scientific journal, English
    DOI URL
  • Contractible edges in k-connected graphs containing no K^-^_4_
    K. Ando; A. Kaneko; K. Kawarabayashi
    SUT J. Math., 36, 1, 99-103, 2000
    English
  • The number of edges in a graph with edge version wide-diameter 2 or 3, Combinatorics, Graph Theory, and Algorithms
    K. Ando; Y. Egawa
    Proceedings of the Eighth Quadrennal International Conference on Graph Theory, Combinatorics, Algorithms, and Applications, New Issues Press,, 1, 43-58, 2000
    English
  • Diagonal flips of plane pseudo triangulations
    H. Komuro; K. Ando
    応用数学合同研究集会報告集, 139-142, Dec. 1999
    English
  • Diagonal flips of plane pseudo triangulations
    安藤 清; 小室秀雄
    Proc. of Japan Conference on Discrete and Computational Geometry '99, 6-7, Nov. 1999
    English
  • Edge-Wide-diameter of graphs with diameter d
    T. Kojima; K. Ando; A. Kaneko
    extended abdstract of 8'th Brtish Combi-natorial Conference, 1999
    English
  • The seven graphs whose H-transformations are uniquely determined
    K Ando; H Komuro
    ARS COMBINATORIA, 46, 305-318, Aug. 1997, Peer-reviwed
    Scientific journal, English
  • The minimum number of edges in a vertex diameter-2-critical graph, Discrete Math.
    K. Ando; Y. Egawa
    Discrete Mathematics, 167-168, 35-63, 1997, Peer-reviwed
    Scientific journal, English
  • A remark on the connectivity of the complement of a 3-connected graph
    K Ando; A Kaneko
    DISCRETE MATHEMATICS, 151, 1-3, 39-47, May 1996, Peer-reviwed
    Scientific journal, English
  • The bandwidth of a tree with k-leaves is at most [┣D7K(/)2┫D7]
    Kiyoshi Ando; Atsushi Kaneko; Severino Gervacio
    Discrete Mathematics, 150, 1-3, 403-406, 1996, Peer-reviwed
    Scientific journal, English
  • An upper bound for orders of certain (k, (]E87C3[))-connected graphs
    Kiyoshi Ando
    Discrete Math., 135, 1-3, 371-375, 1994, Peer-reviwed
    Scientific journal, English
  • Almost no graph are autographs
    Kiyoshi Ando; Katsuhiro Ota
    1-11, 1993, Peer-reviwed
    International conference proceedings, English
  • ある種の代数幾何符号の構成と復号の一方法
    栗原 正純; 水野弘文; 安藤清
    Reports of The Univ. of Electro-Comm., 4, 1, 77-85, 1991, Peer-reviwed
    Research institution, Japanese
  • DISJOINT SUBSETS OF INTEGERS HAVING A CONSTANT SUM
    K ANDO; S GERVACIO; M KANO
    DISCRETE MATHEMATICS, 82, 1, 7-11, May 1990, Peer-reviwed
    Scientific journal, English
  • Algebraic-Geometric Codes of Xs : xsy+ysz+zsx=0
    Kiyoshi Ando; Hirobumi Mizuno
    Proceedings of 1990 International Sympo. on Infor. Theory & Its App., 1990
    International conference proceedings, English
  • 代数曲線xsy+ysx+zsx=0上の代数幾何符号
    安藤清; 水野弘文
    Reports of The Uriv. of electro-Comm., 2, 2, 297-304, 1989, Peer-reviwed
    Research institution, Japanese
  • 符号長とゼータ関数
    水野弘文; 安藤清; 池田浩平; 一条孝
    Reports of the Uriv. of Electro-Comm., 1, 1, 115-120, 1988, Peer-reviwed
    Research institution, Japanese
  • CRITICALLY (K,K)-CONNECTED GRAPHS
    K ANDO; Y USAMI
    DISCRETE MATHEMATICS, 66, 1-2, 15-20, Aug. 1987, Peer-reviwed
    Scientific journal, English
  • GRAPHS-G FOR WHICH G AND GBAR ARE BOTH SEMIDECOMPOSABLE
    K ANDO; Y EGAWA; H MIZUNO
    DISCRETE MATHEMATICS, 65, 2, 109-114, Jun. 1987, Peer-reviwed
    Scientific journal, English
  • CONTRACTILE EDGES IN 3-CONNECTED GRAPHS
    K ANDO; H ENOMOTO; A SAITO
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 42, 1, 87-93, Feb. 1987, Peer-reviwed
    Scientific journal, English
  • The six biconnected graphs
    Kiyoshi ando; Hirobumi Mizuno
    Journal of Graph Theory, 10, 1, 117-121, 1986, Peer-reviwed
    Scientific journal, English
  • RAO CONJECTURE ON SELF-COMPLEMENTARY GRAPHS WITH K-FACTORS
    K ANDO
    JOURNAL OF GRAPH THEORY, 9, 1, 119-121, 1985, Peer-reviwed
    Scientific journal, English
  • ECCENTRIC GRAPHS
    J AKIYAMA; K ANDO; D AVIS
    DISCRETE MATHEMATICS, 56, 1, 1-6, 1985, Peer-reviwed
    Scientific journal, English
  • Biconnectedness of Graphs
    Kiyoshi Ando; Hirobumi Mizuno
    Number Theory and Combinatorics, 37-42, 1985, Peer-reviwed
    International conference proceedings, English
  • Miscellaneous properties of equi-eccentric graphs
    Annals of Discrete Mathematics, 20, 1984
    Scientific journal, English
  • Covering decompositions of graphs
    京都大学数理解研究所講究録, 534, 1984
    Research institution, English
  • Characterizations and Classifications of biconnected graphs
    Annals of Discrete Mathematics, 13, 1982
    Scientific journal, English
  • On Radius Critical Graphs
    京都大学数理解析研究所講究録, 471, 1982
    Research institution, English
  • Biconnectedness of graphs-Forbidden subgraphs and unavoidable subgraphs-
    Reports of The Univ. of Electro-Comm., 32, 2, 1982
    Research institution, English
  • Miscellaneous Properties of Equi-Eccentric graphs
    京都大学数理解析研究所講究録, 427, 1981
    Research institution, English
  • Equi-eccentric graphs with equi-eccentric complements
    TRU Math., 17, 1981
    Research institution, English
  • Certain disconnected groups, II
    Reports of The Univ. of Electro-Comm., 30, 1, 1979
    Research institution, English
  • Certain disconnedted groups, I
    Reports of The Univ. of Electro-Comm., 29, 2, 1978
    Research institution, English
  • Unitary Geometry, II
    Kiyoshi Ando; HIrobumi Mizuno
    Reports of The Univ. of Electro-Comm., 28, 1, 1977
    Research institution, English
  • Unitary Geometry, III
    Kiyoshi Ando; HIrobumi Mizuno
    Reports of The Univ. of Electro-Comm., 28, 2, 1977
    Research institution, English
  • Unitary Geometry, I
    Kiyoshi Ando; Hirobumi Mizuno
    Reports of The University of Electro-Communications, 27, 2, 1976, Peer-reviwed
    Research institution, English

Books and other publications

  • 初等幾何学
    安藤 清; 佐藤 敏明
    森北出版株式会社, Sep. 1994
  • 数学辞典（James nad James Mathematics Dictionary)
    一松信; 伊藤雄二監訳; 安藤清(分担), 他訳
    朝倉書店, Jun. 1993
  • 組合せ論演習
    L.ロバース著; 秋山仁; 榎本彦衛監訳; 安藤清(分担),他訳
    東海大学出版会, 1988

Lectures, oral presentations, etc.

  • Contractible edges in k-connected graphs
    Ando, Kiyoshi
    Invited oral presentation, English, The China-Japan Joint Conference on Discrete Geometry, Combinatorics and Graph Theory, Nankai University and Northwestern Polytechnical University, Tianjin, Xi'an (China), International conference
    Nov. 2005
  • Every 7-contraction critical graph G has $|V(G)|/64$ vertices of degree 7
    K.Ando; A.Kaneko; K.Kawarabayashi
    Oral presentation, English, 2002日本数学会総会
    Mar. 2002
  • Vertices of degree 7 in a 7-contraction critical graph
    Kiyoshi Ando; Atsushi Kaneko; Ken-ichi Kawarabayashi
    Oral presentation, English, 応用数学合同研究集会報告集
    Dec. 2001
  • Vertices of Degree 6 in a 6-contraction Critical Graph
    Kiyoshi Ando; Atsushi Kaneko; Ken-ichi Kawarabayashi
    Oral presentation, English, EuroConference on Combinatorics, Graph Theory and Applications
    Sep. 2001
  • Minimally 5-contraction critical graphs
    K. Ando
    Oral presentation, English, 2001日本数学会秋期総合分科会
    Sep. 2001
  • Graphs G for which both $G$ and $\bar G$ are k-contraction critical
    J. Akiyama; K. Ando
    Oral presentation, English, 2001日本数学会秋期総合分科会
    Sep. 2001
  • Vertices of degree 6 in a 6-contraction critical graph
    Kiyoshi Ando; Atsushi Kaneko; Ken-ichi Kawarabayashi
    Oral presentation, English, HORIZONS IN COMBINATORICS A Conference on Graph Theory, Combinatorics and Computing in conjunction with the 16th Annual Shanks Lectures honoring Baylis and Olivia Shanks
    May 2001
  • The number of vertices of degree 6 in a 6-contraction critical graph
    安藤 清
    Oral presentation, English, 日本数学会応用数学分科会講演アブストラクト
    Mar. 2001
  • Vertices of degree 6 in a 6-contraction critical graph
    K. Ando; A. Kaneko; K. Kawarabayashi
    Oral presentation, English, 応用数学合同研究集会報告集
    Dec. 2000
  • On k-contractibe edges
    K. Ando; A. Kaneko; K. Kawarabayashi
    Oral presentation, English, 第12回日本-フランス組合せ論ワークショップ
    Oct. 2000
  • A property of 5-contraction critical graph
    安藤 清
    Oral presentation, English, 日本数学会応用数学分科会講演アブストラクト
    Sep. 2000
  • On k-contractibe edges
    安藤 清
    Oral presentation, English, 関西グラフ理論セミナー
    Jul. 2000
  • Contractible edges in minimally k-connected graphs
    K. Ando; A. Kaneko; K. Kawarabayashi
    Oral presentation, English, Nineth Quadrennal International Conference on Graph Theory, Combinatorics, Algorithms, and Applications（Kalamazoo, Michigan, U.S.A.）
    Jun. 2000
  • A forbidden subgraph condition for a graph to have a contractible edge
    K. Ando; K. Kawarabayashi
    Oral presentation, English, Combinatorics 2000（Gaeta, Italy）
    May 2000
  • Some sufficent conditions for a graph to have a k-contractible edge
    安藤 清
    Oral presentation, English, 日本数学応用数学分科会講演アブストラクﾄ
    Mar. 2000
  • Wide-diameter and minimum length of disjoint Menger path system
    安藤 清; 小嶋 徹
    Oral presentation, English, 日本数学会応用数学分科会講演アブストラクト
    Mar. 2000

Affiliated academic society

  • 日本数学会
  • 情報理論とその応用学会