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