Haruko Okamura

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2013
Degree Sum Conditions for Cyclability in Bipartite Graphs.
Graphs Comb., 2013

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

Immersing small complete graphs.
Ars Math. Contemp., 2010

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

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

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

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

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

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

1991
2-reducible cycles containing two specified edges in (2k+1)-edge-connected graphs.
Proceedings of the Graph Structure Theory, 1991

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

1988
Paths in <i>k</i>-edge-connected graphs.
J. Comb. Theory B, 1988

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

1984
Paths and edge-connectivity in graphs.
J. Comb. Theory B, 1984

1983
Multicommodity flows in graphs.
Discret. Appl. Math., 1983

1982
Every simple 3-polytope of order 32 or less is Hamiltonian.
J. Graph Theory, 1982

1981
Multicommodity flows in planar graphs.
J. Comb. Theory B, 1981


  Loading...