The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Akira Saito: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Dingjun Lou, Akira Saito, Lihua Teng
    To Determine 1-Extendable Graphs and its Algorithm. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:69, n:, pp:- [Journal]
  2. Akira Saito, Tomoki Yamashita
    A Note on Dominating Cycles in Tough Graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:69, n:, pp:- [Journal]
  3. Yoshimi Egawa, Hikoe Enomoto, Akira Saito
    Contracible edges in triangle-free graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1986, v:6, n:3, pp:269-274 [Journal]
  4. Yoshimi Egawa, Katsuhiro Ota, Akira Saito, Xingxing Yu
    Non-Contractible Edges in A 3-Connected Graph. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1995, v:15, n:3, pp:357-364 [Journal]
  5. Yoshimi Egawa, Akira Saito
    Contractible edges in non-separating cycles. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1991, v:11, n:4, pp:389-392 [Journal]
  6. Hikoe Enomoto, Akira Saito
    Disjoint shortest paths in graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:4, pp:275-279 [Journal]
  7. Akira Saito
    Fan-Type Theorem for Path-Connectivity. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1996, v:16, n:3, pp:433-437 [Journal]
  8. Nawarat Ananchuen, Akira Saito
    Factor criticality and complete closure of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:265, n:1-3, pp:13-21 [Journal]
  9. 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]
  10. Robert E. L. Aldred, Derek A. Holton, Dingjun Lou, Akira Saito
    M-alternating paths in n-extendable bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:269, n:1-3, pp:1-11 [Journal]
  11. Guantao Chen, Akira Saito, Bing Wei, Xuerong Zhang
    The hamiltonicity of bipartite graphs involving neighborhood unions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:249, n:1-3, pp:45-56 [Journal]
  12. Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Akira Saito
    Toughness, degrees and 2-factors. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:286, n:3, pp:245-249 [Journal]
  13. Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Akira Saito
    A note on 2-factors with two components. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:300, n:1-3, pp:218-224 [Journal]
  14. Ken-ichi Kawarabayashi, Katsuhiro Ota, Akira Saito
    Hamiltonian cycles in n-factor-critical graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:240, n:1-3, pp:71-82 [Journal]
  15. Ken-ichi Kawarabayashi, Michael D. Plummer, Akira Saito
    On two equimatchable graph classes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:266, n:1-3, pp:263-274 [Journal]
  16. Dingjun Lou, Akira Saito, Lihua Teng
    A note on internally disjoint alternating paths in bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:290, n:1, pp:105-108 [Journal]
  17. Michael D. Plummer, Akira Saito
    Closure and factor-critical graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:215, n:, pp:171-179 [Journal]
  18. Zdenek Ryjácek, Akira Saito, Richard H. Schelp
    Claw-free graphs with complete closure. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:325-338 [Journal]
  19. Akira Saito, Tomoki Yamashita
    Cycles within specified distance from each vertex. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:278, n:1-3, pp:219-226 [Journal]
  20. Ralph J. Faudree, Richard H. Schelp, Akira Saito, Ingo Schiermeyer
    Degree conditions for hamiltonicity: Counting the number of missing edges. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:7-8, pp:873-877 [Journal]
  21. Yoko Hasegawa, Akira Saito
    Graphs with small boundary. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:14, pp:1801-1807 [Journal]
  22. 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]
  23. Guantao Chen, Akira Saito
    Graphs with a Cycle of Length Divisible by Three. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1994, v:60, n:2, pp:277-292 [Journal]
  24. Hikoe Enomoto, Atsushi Kaneko, Akira Saito, Bing Wei
    Long cycles in triangle-free graphs with prescribed independence number and connectivity. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:91, n:1, pp:43-55 [Journal]
  25. Akira Saito
    Splitting and contractible edges in 4-connected graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:88, n:2, pp:227-235 [Journal]
  26. Akira Saito
    Long cycles through specified vertices in a graph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1989, v:47, n:2, pp:220-230 [Journal]
  27. Shinya Fujita, Ken-ichi Kawarabayashi, Cláudio Leonardo Lucchesi, Katsuhiro Ota, Michael D. Plummer, Akira Saito
    A pair of forbidden subgraphs and perfect matchings. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:3, pp:315-324 [Journal]
  28. Michael D. Plummer, Akira Saito
    Forbidden subgraphs and bounds on the size of a maximum matching. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:50, n:1, pp:1-12 [Journal]
  29. Ken-ichi Kawarabayashi, Michael D. Plummer, Akira Saito
    Domination in a graph with a 2-factor. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:52, n:1, pp:1-6 [Journal]
  30. Guantao Chen, Hikoe Enomoto, Ken-ichi Kawarabayashi, Katsuhiro Ota, Dingjun Lou, Akira Saito
    Vertex-disjoint cycles containing specified vertices in a bipartite graph. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:46, n:3, pp:145-166 [Journal]
  31. Yoshimi Egawa, Hikoe Enomoto, Akira Saito
    Factors and induced subgraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:68, n:2-3, pp:179-189 [Journal]
  32. Mikio Kano, Akira Saito
    [a, b]-factors of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:113-116 [Journal]
  33. Hikoe Enomoto, Michael D. Plummer, Akira Saito
    Neighborhood unions and factor critical graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:205, n:1-3, pp:217-220 [Journal]
  34. Béla Bollobás, Oliver Riordan, Zdenek Ryjácek, Akira Saito, Richard H. Schelp
    Closure and Hamiltonian-connectivity of claw-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:195, n:1-3, pp:67-80 [Journal]
  35. Tsuyoshi Nishimura, Akira Saito
    Two recursive theorems on n-extendibility. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:162, n:1-3, pp:319-323 [Journal]
  36. Robert E. L. Aldred, Bill Jackson, Dingjun Lou, Akira Saito
    Partitioning regular graphs into equicardinal linear forests. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:88, n:1, pp:1-9 [Journal]
  37. Akira Saito
    One-factors and k-factors. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:91, n:3, pp:323-326 [Journal]
  38. Akira Saito
    Cycles of length 2 modulo 3 in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:285-289 [Journal]
  39. Nathaniel Dean, Linda M. Lesniak, Akira Saito
    Cycles of length 0 modulo 4 in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:121, n:1-3, pp:37-49 [Journal]

  40. Characterization of chromatin texture by contour complexity for cancer cell classification. [Citation Graph (, )][DBLP]


  41. Edge-dominating cycles in graphs. [Citation Graph (, )][DBLP]


  42. Closure, stability and iterated line graphs with a 2-factor. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.008secs
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