Kiyoshi Ando

2009
36	EE	Kiyoshi Ando, Yoshimi Egawa, K. Kawarabayashi, Matthias Kriesell: On the number of 4-contractible edges in 4-connected graphs. J. Comb. Theory, Ser. B 99(1): 97-109 (2009)
35	EE	Kiyoshi Ando: A local structure theorem on 5-connected graphs. Journal of Graph Theory 60(2): 99-129 (2009)
2008
34	EE	Kiyoshi Ando, Yoshimi Egawa: Edges not contained in triangles and the distribution of contractible edges in a 4-connected graph. Discrete Mathematics 308(16): 3449-3460 (2008)
33	EE	Kiyoshi Ando, Yoshimi Egawa: Edges not contained in triangles and the number of contractible edges in a 4-connected graph. Discrete Mathematics 308(23): 5463-5472 (2008)
32	EE	Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi: Contractible edges in minimally k-connected graphs. Discrete Mathematics 308(4): 597-602 (2008)
2006
31	EE	Hideo Komuro, Kiyoshi Ando, Atsuhiro Nakamoto: Tight quadrangulations on the sphere. Discrete Mathematics 306(2): 278-283 (2006)
30	EE	Kiyoshi Ando: Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph. Electronic Notes in Discrete Mathematics 24: 25-30 (2006)
2005
29	EE	Kiyoshi Ando: Contractible Edges in a k-Connected Graph. CJCDGCGT 2005: 10-20
28	EE	Kiyoshi Ando: Trivially noncontractible edges in a contraction critically 5-connected graph. Discrete Mathematics 293(1-3): 61-72 (2005)
27	EE	Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi: Vertices of Degree 5 in a Contraction Critically 5-connected Graph. Graphs and Combinatorics 21(1): 27-37 (2005)
2003
26	EE	Kiyoshi Ando, Yoshimi Egawa: Maximum number of edges in a critically k-connected graph. Discrete Mathematics 260(1-3): 1-25 (2003)
25	EE	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. Discrete Mathematics 265(1-3): 23-30 (2003)
24	EE	Kiyoshi Ando, Ken-ichi Kawarabayashi: Some forbidden subgraph conditions for a graph to have a k-contractible edge. Discrete Mathematics 267(1-3): 3-11 (2003)
23	EE	Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi: Vertices of degree 6 in a contraction critically 6-connected graph. Discrete Mathematics 273(1-3): 55-69 (2003)
2002
22		Kiyoshi Ando, Atsuhiro Nakamoto: On Quadrangulations of Closed Surfaces Covered by Vertices of Degree 3. Ars Comb. 62: (2002)
21		Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi, Kiyoshi Yoshiomoto: Contractible Edges and Bowties in a k-Connected Graph. Ars Comb. 64: 239- (2002)
20		Kiyoshi Ando, Atsuhiro Nakamoto: Self-complementary Graphs with Minimum Degree Two. Ars Comb. 65: (2002)
19	EE	Kiyoshi Ando, Yoshimi Egawa, Atsushi Kaneko, Ken-ichi Kawarabayashi, Haruhide Matsuda: Path factors in claw-free graphs. Discrete Mathematics 243(1-3): 195-200 (2002)
18	EE	Toru Kojima, Kiyoshi Ando: Bandwidth of the cartesian product of two connected graphs. Discrete Mathematics 252(1-3): 227-235 (2002)
17	EE	Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi: Contractible edges in minimally k-connected graphs. Electronic Notes in Discrete Mathematics 11: 20-29 (2002)
16	EE	Jin Akiyama, Kiyoshi Ando, Yoshimi Egawa: Graphs G for which both G and G- are Contraction Critically k-Connected. Graphs and Combinatorics 18(4): 693-708 (2002)
2001
15		Toru Kojima, Kiyoshi Ando: Minimum length of cycles through specified vertices in graphs with wide-diameter at most d. Ars Comb. 58: (2001)
14		Hideo Komuro, Kiyoshi Ando: Diagonal flips of pseudo triangulations on the sphere. Ars Comb. 59: (2001)
13	EE	Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi: Vertices of degree 6 in a 6-contraction critical graph. Electronic Notes in Discrete Mathematics 10: 2-6 (2001)
2000
12	EE	Kiyoshi Ando: Contractible edges in a k-connected graph (K1 + P4)-free graph. Electronic Notes in Discrete Mathematics 5: 7-10 (2000)
11	EE	Toru Kojima, Kiyoshi Ando: Wide-diameter and minimum length of fan. Theor. Comput. Sci. 235(2): 257-266 (2000)
1999
10	EE	Kiyoshi Ando, Atsushi Kaneko, Tsuyoshi Nishimura: A degree condition for the existence of 1-factors in graphs or their complements. Discrete Mathematics 203(1-3): 1-8 (1999)
1997
9		Kiyoshi Ando, Hideo Komuro: The seven graphs whose H-transformations are uniquely determined. Ars Comb. 46: (1997)
8	EE	Kiyoshi Ando, Yoshimi Egawa: The minimum number of edges in a vertex diameter-2-critical graph. Discrete Mathematics 167-168: 35-63 (1997)
1996
7	EE	Kiyoshi Ando, Atsushi Kaneko: A remark on the connectivity of the complement of a 3-connected graph. Discrete Mathematics 151(1-3): 39-47 (1996)
1994
6	EE	Kiyoshi Ando: An upper bound for orders of certain (k, k_))-connected graphs. Discrete Mathematics 135(1-3): 371-375 (1994)
1990
5	EE	Kiyoshi Ando, Severino V. Gervacio, Mikio Kano: Disjoint subsets of integers having a constant sum. Discrete Mathematics 82(1): 7-11 (1990)
1987
4	EE	Kiyoshi Ando, Yoshimi Egawa, Hirobumi Mizuno: Graphs G for which G and _G are both semidecomposable. Discrete Mathematics 65(2): 109-114 (1987)
3	EE	Kiyoshi Ando, Yoko Usami: Critically (k, k)-connected graphs. Discrete Mathematics 66(1-2): 15-20 (1987)
2	EE	Kiyoshi Ando, Hikoe Enomoto, Akira Saito: Contractible edges in 3-connected graphs. J. Comb. Theory, Ser. B 42(1): 87-93 (1987)
1985
1	EE	Jin Akiyama, Kiyoshi Ando, David Avis: Eccentric graphs. Discrete Mathematics 56(1): 1-6 (1985)

Coauthor Index

1	Jin Akiyama	[1] [16]
2	David Avis	[1]
3	Yoshimi Egawa	[4] [8] [16] [19] [26] [33] [34] [36]
4	Hikoe Enomoto	[2]
5	Severino V. Gervacio	[5]
6	Mariko Hagita	[25]
7	Atsushi Kaneko	[7] [10] [13] [17] [19] [21] [23] [25] [27] [32]
8	Mikio Kano (M. Kano)	[5] [25]
9	K. Kawarabayashi	[36]
10	Ken-ichi Kawarabayashi	[13] [17] [19] [21] [23] [24] [25] [27] [32]
11	Toru Kojima	[11] [15] [18]
12	Hideo Komuro	[9] [14] [31]
13	Matthias Kriesell	[36]
14	Haruhide Matsuda	[19]
15	Hirobumi Mizuno	[4]
16	Atsuhiro Nakamoto	[20] [22] [31]
17	Tsuyoshi Nishimura	[10]
18	Akira Saito	[2] [25]
19	Yoko Usami	[3]
20	Kiyoshi Yoshimoto (Kiyoshi Yoshiomoto)	[21]

Colors in the list of coauthors