Kiyoshi Ando

Publication Activity (10 Years)

Years Active: 1985-2023
Publications (10 Years): 11

Top Topics

Subgraph Isomorphism

Connected Graphs

Connected Components

Top Venues

J. Graph Theory

Publications

Kiyoshi Ando, Yoshimi Egawa
Properly 3-contractible edges in a minimally 3-connected graph. Discret. Math. 346 (5) (2023)
Kiyoshi Ando
A Constructive Characterization of 4-Connected Graphs. Graphs Comb. 38 (4) (2022)
Kiyoshi Ando
Contractible edges and liftable vertices in a 4-connected graph. Discret. Math. 345 (2) (2022)
Kiyoshi Ando
-connected graphs with minimum degree greater than or equal to ⌊3k-12⌋. Discret. Math. 344 (7) (2021)
Kiyoshi Ando, Yoshimi Egawa
Contractible Edges and Contractible Triangles in a 3-Connected Graph. Graphs Comb. 37 (5) (2021)
Kiyoshi Ando
A new forbidden subgraph for 5-contractible edges. Discret. Math. 343 (8) (2020)
Chengfu Qin, Weihua He, Kiyoshi Ando
A constructive characterization of contraction critical 8-connected graphs with minimum degree 9. Discret. Math. 342 (11) (2019)
Kiyoshi Ando
A local condition for k-contractible edges. Discret. Math. 342 (12) (2019)
Kiyoshi Ando
A new forbidden pair for 6-contractible edges. Discret. Math. 341 (11) (2018)
Kiyoshi Ando
Small Components of the 5-Subgraph of a Contraction-critically 5-Connected Graph. Graphs Comb. 33 (6) (2017)
Kiyoshi Ando
Some degree and forbidden subgraph conditions for a graph to have a k-contractible edge. Discret. Math. 339 (1) (2016)
Chengfu Qin, Xiaofeng Guo, Kiyoshi Ando
The Removable Edges and the Contractible Subgraphs of 5-Connected Graphs. Graphs Comb. 31 (1) (2015)
Kiyoshi Ando, Yoshimi Egawa, Matthias Kriesell
The Average Degree of Minimally Contraction-Critically 5-Connected Graphs. J. Graph Theory 75 (4) (2014)
Kiyoshi Ando, Shinya Fujita, Ken-ichi Kawarabayashi
Minimally contraction-critically 6-connected graphs. Discret. Math. 312 (3) (2012)
Kiyoshi Ando, Chengfu Qin
Some structural properties of minimally contraction-critically 5-connected graphs. Discret. Math. 311 (13) (2011)
Kiyoshi Ando, Takashi Iwase
The number of vertices of degree 5 in a contraction-critically 5-connected graph. Discret. Math. 311 (17) (2011)
Kiyoshi Ando
A local structure theorem on 5-connected graphs. J. Graph Theory 60 (2) (2009)
Kiyoshi Ando, Yoshimi Egawa, Ken-ichi Kawarabayashi, Matthias Kriesell
On the number of 4-contractible edges in 4-connected graphs. J. Comb. Theory, Ser. B 99 (1) (2009)
Kiyoshi Ando
Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph. Discret. Math. 309 (22) (2009)
Kiyoshi Ando, Yoshimi Egawa
Edges not contained in triangles and the number of contractible edges in a 4-connected graph. Discret. Math. 308 (23) (2008)
Kiyoshi Ando, Yoshimi Egawa
Edges not contained in triangles and the distribution of contractible edges in a 4-connected graph. Discret. Math. 308 (16) (2008)
Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi
Contractible edges in minimally k-connected graphs. Discret. Math. 308 (4) (2008)
Kiyoshi Ando, Yoshimi Egawa
Contractible Edges in a 4-Connected Graph with Vertices of Degree Greater Than Four. Graphs Comb. 23 (Supplement-1) (2007)
Kiyoshi Ando
Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph. Electron. Notes Discret. Math. 24 (2006)
Hideo Komuro, Kiyoshi Ando, Atsuhiro Nakamoto
Tight quadrangulations on the sphere. Discret. Math. 306 (2) (2006)
Kiyoshi Ando
-Connected Graph. CJCDGCGT (2005)
Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi
Vertices of Degree 5 in a Contraction Critically 5-connected Graph. Graphs Comb. 21 (1) (2005)
Kiyoshi Ando
Trivially noncontractible edges in a contraction critically 5-connected graph. Discret. Math. 293 (1-3) (2005)
Kiyoshi Ando, Ken-ichi Kawarabayashi
-contractible edge. Discret. Math. 267 (1-3) (2003)
Kiyoshi Ando, Mariko Hagita, Atsushi Kaneko, Mikio Kano, Ken-ichi Kawarabayashi, Akira Saito
Cycles having the same modularity and removable edges in 2-connected graphs. Discret. Math. 265 (1-3) (2003)
Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi
Vertices of degree 6 in a contraction critically 6-connected graph. Discret. Math. 273 (1-3) (2003)
Kiyoshi Ando, Yoshimi Egawa
-connected graph. Discret. Math. 260 (1-3) (2003)
Jin Akiyama, Kiyoshi Ando, Yoshimi Egawa
are Contraction Critically k-Connected. Graphs Comb. 18 (4) (2002)
Kiyoshi Ando, Atsuhiro Nakamoto
On Quadrangulations of Closed Surfaces Covered by Vertices of Degree 3. Ars Comb. 62 (2002)
Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi
Contractible edges in minimally k-connected graphs. Electron. Notes Discret. Math. 11 (2002)
Kiyoshi Ando, Yoshimi Egawa, Atsushi Kaneko, Ken-ichi Kawarabayashi, Haruhide Matsuda
Path factors in claw-free graphs. Discret. Math. 243 (1-3) (2002)
Toru Kojima, Kiyoshi Ando
Bandwidth of the cartesian product of two connected graphs. Discret. Math. 252 (1-3) (2002)
Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi, Kiyoshi Yoshiomoto
Contractible Edges and Bowties in a k-Connected Graph. Ars Comb. 64 (2002)
Kiyoshi Ando, Atsuhiro Nakamoto
Self-complementary Graphs with Minimum Degree Two. Ars Comb. 65 (2002)
Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi
Vertices of degree 6 in a 6-contraction critical graph. Electron. Notes Discret. Math. 10 (2001)
Hideo Komuro, Kiyoshi Ando
Diagonal flips of pseudo triangulations on the sphere. Ars Comb. 59 (2001)
Toru Kojima, Kiyoshi Ando
Minimum length of cycles through specified vertices in graphs with wide-diameter at most d. Ars Comb. 58 (2001)
Kiyoshi Ando
)-free graph. Electron. Notes Discret. Math. 5 (2000)
Toru Kojima, Kiyoshi Ando
Wide-diameter and minimum length of fan. Theor. Comput. Sci. 235 (2) (2000)
Kiyoshi Ando, Atsushi Kaneko, Tsuyoshi Nishimura
A degree condition for the existence of 1-factors in graphs or their complements. Discret. Math. 203 (1-3) (1999)
Kiyoshi Ando, Yoshimi Egawa
The minimum number of edges in a vertex diameter-2-critical graph. Discret. Math. (1997)
Kiyoshi Ando, Hideo Komuro
The seven graphs whose H-transformations are uniquely determined. Ars Comb. 46 (1997)
Kiyoshi Ando, Atsushi Kaneko, Severino Villanueva Gervacio
The bandwidth of a tree with k leaves is at most. Discret. Math. 150 (1-3) (1996)
Kiyoshi Ando, Atsushi Kaneko
A remark on the connectivity of the complement of a 3-connected graph. Discret. Math. 151 (1-3) (1996)
Kiyoshi Ando
))-connected graphs. Discret. Math. 135 (1-3) (1994)
Kiyoshi Ando, Severino Villanueva Gervacio, Mikio Kano
Disjoint subsets of integers having a constant sum. Discret. Math. 82 (1) (1990)
Kiyoshi Ando, Yoko Usami
Critically (k, k)-connected graphs. Discret. Math. 66 (1-2) (1987)
Kiyoshi Ando, Hikoe Enomoto, Akira Saito
Contractible edges in 3-connected graphs. J. Comb. Theory, Ser. B 42 (1) (1987)
Kiyoshi Ando, Yoshimi Egawa, Hirobumi Mizuno
Graphs G for which G and _G are both semidecomposable. Discret. Math. 65 (2) (1987)
Kiyoshi Ando, Hirobumi Mizuno
The six bidecomposable graphs. J. Graph Theory 10 (1) (1986)
Kiyoshi Ando
-factors. J. Graph Theory 9 (1) (1985)
Jin Akiyama, Kiyoshi Ando, David Avis
Eccentric graphs. Discret. Math. 56 (1) (1985)