Haruko Okamura

18 papers Journal 17Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
2-Reducible Two Paths and Two Edges Constructing a Cycle in (2k+1)-Edge-Connected Graphs.
Graphs Comb.
Haruko Okamura
2013 J jnl
Degree Sum Conditions for Cyclability in Bipartite Graphs.
Graphs Comb.
Haruko Okamura, Tomoki Yamashita
2010 J jnl
2-Reducible Two Paths and an Edge Constructing a Path in (2
Graphs Comb.
Haruko Okamura
2010 J jnl
Immersing small complete graphs.
Ars Math. Contemp.
Matt DeVos, Ken-ichi Kawarabayashi, Bojan Mohar, Haruko Okamura
2005 J jnl
Two Paths Joining Given Vertices in 2
Graphs Comb.
Haruko Okamura
2005 J jnl
Two paths joining given vertices in (2k+1)-edge-connected graphs.
Ars Comb.
Haruko Okamura
2001 J jnl
2-Reducible paths containing a specified edge in (2k+1)-edge-connected graphs.
Ars Comb.
Haruko Okamura
1995 J jnl
2-reducible cycles containing three consecutive edges in (2
Graphs Comb.
Haruko Okamura
1993 J jnl
Paths containing two adjacent edges in (2k+1)-edge-connected graphs.
Discret. Math.
Haruko Okamura
1992 J jnl
Counterexamples to a conjecture of mader about cycles through specified vertices in
Graphs Comb.
Andreas Huck, Haruko Okamura
1991 — conf
2-reducible cycles containing two specified edges in (2k+1)-edge-connected graphs.
Graph Structure Theory
Haruko Okamura
1990 J jnl
Every 4
Graphs Comb.
Haruko Okamura
1988 J jnl
Paths in
J. Comb. Theory B
Haruko Okamura
1987 J jnl
Paths and edge-connectivity in graphs III. Six-terminal
Graphs Comb.
Haruko Okamura
1984 J jnl
Paths and edge-connectivity in graphs.
J. Comb. Theory B
Haruko Okamura
1983 J jnl
Multicommodity flows in graphs.
Discret. Appl. Math.
Haruko Okamura
1982 J jnl
Every simple 3-polytope of order 32 or less is Hamiltonian.
J. Graph Theory
Haruko Okamura
1981 J jnl
Multicommodity flows in planar graphs.
J. Comb. Theory B
Haruko Okamura, Paul D. Seymour