Search the dblp DataBase
Haruko Okamura: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Haruko Okamura
2-reducible cycles containing two specified edges in (2k+1)-edge-connected graphs. [Citation Graph (0, 0)][DBLP]
Graph Structure Theory, 1991, pp:259-278 [Conf] - Haruko Okamura
2-Reducible paths containing a specified edge in (2k+1)-edge-connected graphs. [Citation Graph (0, 0)][DBLP]
Ars Comb., 2001, v:61, n:, pp:- [Journal] - Haruko Okamura
Two paths joining given vertices in (2k+1)-edge-connected graphs. [Citation Graph (0, 0)][DBLP]
Ars Comb., 2005, v:75, n:, pp:- [Journal] - Haruko Okamura
Two Paths Joining Given Vertices in 2k-Edge-Connected Graphs. [Citation Graph (0, 0)][DBLP]
Graphs and Combinatorics, 2005, v:21, n:4, pp:503-514 [Journal] - Haruko Okamura
Paths and edge-connectivity in graphs. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. B, 1984, v:37, n:2, pp:151-172 [Journal] - Haruko Okamura
Paths in k-edge-connected graphs. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. B, 1988, v:45, n:3, pp:345-355 [Journal] - Haruko Okamura
Paths containing two adjacent edges in (2k+1)-edge-connected graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1993, v:111, n:1-3, pp:401-407 [Journal]
Search in 0.001secs, Finished in 0.001secs
| 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 |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002