Eccentric graphs. - Jin Akiyama; Kiyoshi Ando; David Avis (Discret. Math., 1985)

Rao's conjecture on self-complementary graphs with K-factors. - Kiyoshi Ando (J. Graph Theory, 1985)

The six bidecomposable graphs. - Kiyoshi Ando; Hirobumi Mizuno (J. Graph Theory, 1986)

Graphs G for which G and _G are both semidecomposable. - Kiyoshi Ando; Yoshimi Egawa; Hirobumi Mizuno (Discret. Math., 1987)

Critically (k, k)-connected graphs. - Kiyoshi Ando; Yoko Usami (Discret. Math., 1987)

Contractible edges in 3-connected graphs. - Kiyoshi Ando; Hikoe Enomoto; Akira Saito (J. Comb. Theory B, 1987)

Disjoint subsets of integers having a constant sum. - Kiyoshi Ando; Severino Villanueva Gervacio; Mikio Kano (Discret. Math., 1990)

An upper bound for orders of certain (k, k_))-connected graphs. - Kiyoshi Ando (Discret. Math., 1994)

A remark on the connectivity of the complement of a 3-connected graph. - Kiyoshi Ando; Atsushi Kaneko (Discret. Math., 1996)

The bandwidth of a tree with k leaves is at most. - Kiyoshi Ando; Atsushi Kaneko; Severino Villanueva Gervacio (Discret. Math., 1996)

The seven graphs whose H-transformations are uniquely determined. - Kiyoshi Ando; Hideo Komuro (Ars Comb., 1997)

The minimum number of edges in a vertex diameter-2-critical graph. - Kiyoshi Ando; Yoshimi Egawa (Discret. Math., 1997)

A degree condition for the existence of 1-factors in graphs or their complements. - Kiyoshi Ando; Atsushi Kaneko; Tsuyoshi Nishimura (Discret. Math., 1999)

Contractible edges in a k-connected graph (K1 + P4)-free graph. - Kiyoshi Ando (Electron. Notes Discret. Math., 2000)

Wide-diameter and minimum length of fan. - Toru Kojima; Kiyoshi Ando (Theor. Comput. Sci., 2000)

Minimum length of cycles through specified vertices in graphs with wide-diameter at most d. - Toru Kojima; Kiyoshi Ando (Ars Comb., 2001)

Diagonal flips of pseudo triangulations on the sphere. - Hideo Komuro; Kiyoshi Ando (Ars Comb., 2001)

Vertices of degree 6 in a 6-contraction critical graph. - Kiyoshi Ando; Atsushi Kaneko; Ken-ichi Kawarabayashi (Electron. Notes Discret. Math., 2001)

Contractible Edges and Bowties in a k-Connected Graph. - Kiyoshi Ando; Atsushi Kaneko; Ken-ichi Kawarabayashi; Kiyoshi Yoshiomoto (Ars Comb., 2002)

Self-complementary Graphs with Minimum Degree Two. - Kiyoshi Ando; Atsuhiro Nakamoto (Ars Comb., 2002)

On Quadrangulations of Closed Surfaces Covered by Vertices of Degree 3. - Kiyoshi Ando; Atsuhiro Nakamoto (Ars Comb., 2002)

Path factors in claw-free graphs. - Kiyoshi Ando; Yoshimi Egawa; Atsushi Kaneko; Ken-ichi Kawarabayashi; Haruhide Matsuda (Discret. Math., 2002)

Bandwidth of the cartesian product of two connected graphs. - Toru Kojima; Kiyoshi Ando (Discret. Math., 2002)

Contractible edges in minimally k-connected graphs. - Kiyoshi Ando; Atsushi Kaneko; Ken-ichi Kawarabayashi (Electron. Notes Discret. Math., 2002)

Graphs G for which both G and G- are Contraction Critically k-Connected. - Jin Akiyama; Kiyoshi Ando; Yoshimi Egawa (Graphs Comb., 2002)

Maximum number of edges in a critically k-connected graph. - Kiyoshi Ando; Yoshimi Egawa (Discret. Math., 2003)

Cycles having the same modularity and removable edges in 2-connected graphs. - Kiyoshi Ando; Mariko Hagita; Atsushi Kaneko; Mikio Kano; Ken-ichi Kawarabayashi; Akira Saito (Discret. Math., 2003)

Some forbidden subgraph conditions for a graph to have a k-contractible edge. - Kiyoshi Ando; Ken-ichi Kawarabayashi (Discret. Math., 2003)

Vertices of degree 6 in a contraction critically 6-connected graph. - Kiyoshi Ando; Atsushi Kaneko; Ken-ichi Kawarabayashi (Discret. Math., 2003)

Contractible Edges in a k-Connected Graph. - Kiyoshi Ando (CJCDGCGT, 2005)

Trivially noncontractible edges in a contraction critically 5-connected graph. - Kiyoshi Ando (Discret. Math., 2005)

Vertices of Degree 5 in a Contraction Critically 5-connected Graph. - Kiyoshi Ando; Atsushi Kaneko; Ken-ichi Kawarabayashi (Graphs Comb., 2005)

Tight quadrangulations on the sphere. - Hideo Komuro; Kiyoshi Ando; Atsuhiro Nakamoto (Discret. Math., 2006)

Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph. - Kiyoshi Ando (Electron. Notes Discret. Math., 2006)

Contractible Edges in a 4-Connected Graph with Vertices of Degree Greater Than Four. - Kiyoshi Ando; Yoshimi Egawa (Graphs Comb., 2007)

Edges not contained in triangles and the distribution of contractible edges in a 4-connected graph. - Kiyoshi Ando; Yoshimi Egawa (Discret. Math., 2008)

Edges not contained in triangles and the number of contractible edges in a 4-connected graph. - Kiyoshi Ando; Yoshimi Egawa (Discret. Math., 2008)

On the number of 4-contractible edges in 4-connected graphs. - Kiyoshi Ando; Yoshimi Egawa; Ken-ichi Kawarabayashi; Matthias Kriesell (J. Comb. Theory B, 2009)

A local structure theorem on 5-connected graphs. - Kiyoshi Ando (J. Graph Theory, 2009)

The number of vertices of degree 5 in a contraction-critically 5-connected graph. - Kiyoshi Ando; Takashi Iwase (Discret. Math., 2011)

Some structural properties of minimally contraction-critically 5-connected graphs. - Kiyoshi Ando; Chengfu Qin (Discret. Math., 2011)

Minimally contraction-critically 6-connected graphs. - Kiyoshi Ando; Shinya Fujita 001; Ken-ichi Kawarabayashi (Discret. Math., 2012)

The Average Degree of Minimally Contraction-Critically 5-Connected Graphs. - Kiyoshi Ando; Yoshimi Egawa; Matthias Kriesell (J. Graph Theory, 2014)

The Removable Edges and the Contractible Subgraphs of 5-Connected Graphs. - Chengfu Qin; Xiaofeng Guo; Kiyoshi Ando (Graphs Comb., 2015)

Some degree and forbidden subgraph conditions for a graph to have a k-contractible edge. - Kiyoshi Ando (Discret. Math., 2016)

Small Components of the 5-Subgraph of a Contraction-critically 5-Connected Graph. - Kiyoshi Ando (Graphs Comb., 2017)

A new forbidden pair for 6-contractible edges. - Kiyoshi Ando (Discret. Math., 2018)

A local condition for k-contractible edges. - Kiyoshi Ando (Discret. Math., 2019)

A constructive characterization of contraction critical 8-connected graphs with minimum degree 9. - Chengfu Qin; Weihua He; Kiyoshi Ando (Discret. Math., 2019)

A new forbidden subgraph for 5-contractible edges. - Kiyoshi Ando (Discret. Math., 2020)

Contractible edges in k-connected graphs with minimum degree greater than or equal to ⌊3k-12⌋. - Kiyoshi Ando (Discret. Math., 2021)

Contractible Edges and Contractible Triangles in a 3-Connected Graph. - Kiyoshi Ando; Yoshimi Egawa (Graphs Comb., 2021)

Contractible edges and liftable vertices in a 4-connected graph. - Kiyoshi Ando (Discret. Math., 2022)

A Constructive Characterization of 4-Connected Graphs. - Kiyoshi Ando (Graphs Comb., 2022)

Properly 3-contractible edges in a minimally 3-connected graph. - Kiyoshi Ando; Yoshimi Egawa (Discret. Math., 2023)