| 2005 |
|---|
| 7 | | Haruko Okamura:
Two paths joining given vertices in (2k+1)-edge-connected graphs.
Ars Comb. 75: (2005) |
| 6 | EE | Haruko Okamura:
Two Paths Joining Given Vertices in 2k-Edge-Connected Graphs.
Graphs and Combinatorics 21(4): 503-514 (2005) |
| 2001 |
|---|
| 5 | | Haruko Okamura:
2-Reducible paths containing a specified edge in (2k+1)-edge-connected graphs.
Ars Comb. 61: (2001) |
| 1993 |
|---|
| 4 | EE | Haruko Okamura:
Paths containing two adjacent edges in (2k+1)-edge-connected graphs.
Discrete Mathematics 111(1-3): 401-407 (1993) |
| 1991 |
|---|
| 3 | | Haruko Okamura:
2-reducible cycles containing two specified edges in (2k+1)-edge-connected graphs.
Graph Structure Theory 1991: 259-278 |
| 1988 |
|---|
| 2 | EE | Haruko Okamura:
Paths in k-edge-connected graphs.
J. Comb. Theory, Ser. B 45(3): 345-355 (1988) |
| 1984 |
|---|
| 1 | EE | Haruko Okamura:
Paths and edge-connectivity in graphs.
J. Comb. Theory, Ser. B 37(2): 151-172 (1984) |
