The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Kiyoshi Ando: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. Kiyoshi Ando, Atsuhiro Nakamoto
    Self-complementary Graphs with Minimum Degree Two. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2002, v:65, n:, pp:- [Journal]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. Kiyoshi Ando, Yoshimi Egawa
    Maximum number of edges in a critically k-connected graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:260, n:1-3, pp:1-25 [Journal]
  9. 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]
  10. 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]
  11. Kiyoshi Ando, Ken-ichi Kawarabayashi
    Some forbidden subgraph conditions for a graph to have a k-contractible edge. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:267, n:1-3, pp:3-11 [Journal]
  12. 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]
  13. 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]
  14. 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]
  15. Jin Akiyama, Kiyoshi Ando, Yoshimi Egawa
    Graphs G for which both G and G- are Contraction Critically k-Connected. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2002, v:18, n:4, pp:693-708 [Journal]
  16. 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]
  17. 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]
  18. 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]
  19. Kiyoshi Ando
    Contractible Edges in a k-Connected Graph. [Citation Graph (0, 0)][DBLP]
    CJCDGCGT, 2005, pp:10-20 [Conf]
  20. Jin Akiyama, Kiyoshi Ando, David Avis
    Eccentric graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:56, n:1, pp:1-6 [Journal]
  21. 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]
  22. 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]
  23. 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]
  24. 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]
  25. 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]
  26. 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]
  27. Kiyoshi Ando
    An upper bound for orders of certain (k, k_))-connected graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:135, n:1-3, pp:371-375 [Journal]

  28. Contractible edges in minimally k-connected graphs. [Citation Graph (, )][DBLP]


  29. Edges not contained in triangles and the number of contractible edges in a 4-connected graph. [Citation Graph (, )][DBLP]


  30. Edges not contained in triangles and the distribution of contractible edges in a 4-connected graph. [Citation Graph (, )][DBLP]


  31. Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph. [Citation Graph (, )][DBLP]


Search in 0.214secs, Finished in 0.215secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002