Haruko Okamura

According to our database, Haruko Okamura authored at least 17 papers between 1981 and 2013.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2013

Degree Sum Conditions for Cyclability in Bipartite Graphs.

Haruko Okamura, Tomoki Yamashita

Graphs Comb., 2013

2010

2-Reducible Two Paths and an Edge Constructing a Path in (2<i>k</i> + 1)-Edge-Connected Graphs.

Haruko Okamura

Graphs Comb., 2010

Immersing small complete graphs.

Matt DeVos, Ken-ichi Kawarabayashi, Bojan Mohar, Haruko Okamura

Ars Math. Contemp., 2010

2005

Two Paths Joining Given Vertices in 2<i>k</i>-Edge-Connected Graphs.

Haruko Okamura

Graphs Comb., 2005

Two paths joining given vertices in (2k+1)-edge-connected graphs.

Haruko Okamura

Ars Comb., 2005

2001

2-Reducible paths containing a specified edge in (2k+1)-edge-connected graphs.

Haruko Okamura

Ars Comb., 2001

1995

2-reducible cycles containing three consecutive edges in (2<i>k</i> + 1)-edge-connected graphs.

Haruko Okamura

Graphs Comb., 1995

1993

Paths containing two adjacent edges in (2k+1)-edge-connected graphs.

Haruko Okamura

Discret. Math., 1993

1992

Counterexamples to a conjecture of mader about cycles through specified vertices in<i>n</i>-edge-connected graphs.

Andreas Huck, Haruko Okamura

Graphs Comb., 1992

1991

2-reducible cycles containing two specified edges in (2k+1)-edge-connected graphs.

Haruko Okamura

Proceedings of the Graph Structure Theory, 1991

1990

Every 4<i>k</i>-edge-connected graph is Weakly 3<i>k</i>-linked.

Haruko Okamura

Graphs Comb., 1990

1988

Paths in <i>k</i>-edge-connected graphs.

Haruko Okamura

J. Comb. Theory, Ser. B, 1988

1987

Paths and edge-connectivity in graphs III. Six-terminal<i>k</i> paths.

Haruko Okamura

Graphs Comb., 1987

1984

Paths and edge-connectivity in graphs.

Haruko Okamura

J. Comb. Theory, Ser. B, 1984

1983

Multicommodity flows in graphs.

Haruko Okamura

Discret. Appl. Math., 1983

1982

Every simple 3-polytope of order 32 or less is Hamiltonian.

Haruko Okamura

J. Graph Theory, 1982

1981

Multicommodity flows in planar graphs.

Haruko Okamura, Paul D. Seymour

J. Comb. Theory, Ser. B, 1981