The SCEAS System
| |||||||

## Search the dblp DataBase
Kiyoshi Ando:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Kiyoshi Ando, Hideo Komuro
**The seven graphs whose H-transformations are uniquely determined.**[Citation Graph (0, 0)][DBLP] Ars Comb., 1997, v:46, n:, pp:- [Journal] - Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi, Kiyoshi Yoshiomoto
**Contractible Edges and Bowties in a k-Connected Graph.**[Citation Graph (0, 0)][DBLP] Ars Comb., 2002, v:64, n:, pp:239-0 [Journal] - Kiyoshi Ando, Atsuhiro Nakamoto
**Self-complementary Graphs with Minimum Degree Two.**[Citation Graph (0, 0)][DBLP] Ars Comb., 2002, v:65, n:, pp:- [Journal] - Kiyoshi Ando, Atsuhiro Nakamoto
**On Quadrangulations of Closed Surfaces Covered by Vertices of Degree 3.**[Citation Graph (0, 0)][DBLP] Ars Comb., 2002, v:62, n:, pp:- [Journal] - Toru Kojima, Kiyoshi Ando
**Minimum length of cycles through specified vertices in graphs with wide-diameter at most d.**[Citation Graph (0, 0)][DBLP] Ars Comb., 2001, v:58, n:, pp:- [Journal] - Hideo Komuro, Kiyoshi Ando
**Diagonal flips of pseudo triangulations on the sphere.**[Citation Graph (0, 0)][DBLP] Ars Comb., 2001, v:59, n:, pp:- [Journal] - Kiyoshi Ando
**Trivially noncontractible edges in a contraction critically 5-connected graph.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2005, v:293, n:1-3, pp:61-72 [Journal] - Kiyoshi Ando, Yoshimi Egawa
**Maximum number of edges in a critically**[Citation Graph (0, 0)][DBLP]*k*-connected graph. Discrete Mathematics, 2003, v:260, n:1-3, pp:1-25 [Journal] - Kiyoshi Ando, Yoshimi Egawa, Atsushi Kaneko, Ken-ichi Kawarabayashi, Haruhide Matsuda
**Path factors in claw-free graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:243, n:1-3, pp:195-200 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:265, n:1-3, pp:23-30 [Journal] - Kiyoshi Ando, Ken-ichi Kawarabayashi
**Some forbidden subgraph conditions for a graph to have a**[Citation Graph (0, 0)][DBLP]*k*-contractible edge. Discrete Mathematics, 2003, v:267, n:1-3, pp:3-11 [Journal] - Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi
**Vertices of degree 6 in a contraction critically 6-connected graph.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:273, n:1-3, pp:55-69 [Journal] - Toru Kojima, Kiyoshi Ando
**Bandwidth of the cartesian product of two connected graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:252, n:1-3, pp:227-235 [Journal] - Hideo Komuro, Kiyoshi Ando, Atsuhiro Nakamoto
**Tight quadrangulations on the sphere.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2006, v:306, n:2, pp:278-283 [Journal] - Jin Akiyama, Kiyoshi Ando, Yoshimi Egawa
**Graphs G for which both G and G**[Citation Graph (0, 0)][DBLP]^{-}are Contraction Critically k-Connected. Graphs and Combinatorics, 2002, v:18, n:4, pp:693-708 [Journal] - Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi
**Vertices of Degree 5 in a Contraction Critically 5-connected Graph.**[Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2005, v:21, n:1, pp:27-37 [Journal] - Kiyoshi Ando, Hikoe Enomoto, Akira Saito
**Contractible edges in 3-connected graphs.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1987, v:42, n:1, pp:87-93 [Journal] - Toru Kojima, Kiyoshi Ando
**Wide-diameter and minimum length of fan.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2000, v:235, n:2, pp:257-266 [Journal] - Kiyoshi Ando
**Contractible Edges in a**[Citation Graph (0, 0)][DBLP]*k*-Connected Graph. CJCDGCGT, 2005, pp:10-20 [Conf] - Jin Akiyama, Kiyoshi Ando, David Avis
**Eccentric graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1985, v:56, n:1, pp:1-6 [Journal] - Kiyoshi Ando, Yoshimi Egawa, Hirobumi Mizuno
**Graphs G for which G and _G are both semidecomposable.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1987, v:65, n:2, pp:109-114 [Journal] - Kiyoshi Ando, Yoko Usami
**Critically (k, k)-connected graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1987, v:66, n:1-2, pp:15-20 [Journal] - Kiyoshi Ando, Atsushi Kaneko, Tsuyoshi Nishimura
**A degree condition for the existence of 1-factors in graphs or their complements.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1999, v:203, n:1-3, pp:1-8 [Journal] - Kiyoshi Ando, Yoshimi Egawa
**The minimum number of edges in a vertex diameter-2-critical graph.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1997, v:167, n:, pp:35-63 [Journal] - Kiyoshi Ando, Severino V. Gervacio, Mikio Kano
**Disjoint subsets of integers having a constant sum.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1990, v:82, n:1, pp:7-11 [Journal] - Kiyoshi Ando, Atsushi Kaneko
**A remark on the connectivity of the complement of a 3-connected graph.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1996, v:151, n:1-3, pp:39-47 [Journal] - Kiyoshi Ando
**An upper bound for orders of certain (k, k**[Citation Graph (0, 0)][DBLP]^{_}))-connected graphs. Discrete Mathematics, 1994, v:135, n:1-3, pp:371-375 [Journal] **Contractible edges in minimally k-connected graphs.**[Citation Graph (, )][DBLP]**Edges not contained in triangles and the number of contractible edges in a 4-connected graph.**[Citation Graph (, )][DBLP]**Edges not contained in triangles and the distribution of contractible edges in a 4-connected graph.**[Citation Graph (, )][DBLP]**Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph.**[Citation Graph (, )][DBLP]
Search in 0.221secs, Finished in 0.222secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |