岡村治子 (Haruko Okamura) - マイポータル - researchmap

基本情報

学位: 理学博士(大阪大学)

J-GLOBAL ID: 200901031487764885
researchmap会員ID: 1000056328

研究キーワード

2

研究分野

2

経歴

1

甲南大学知能情報学部知能情報学科, その他

学歴

4

MISC

38

2-Reducible Two Paths and an Edge Constructing a Path in (2k+1)-Edge-Connected Graphs

Haruko Okamura

GRAPHS AND COMBINATORICS 26(4) 571-589 2010年7月
Immersing small complete graphs

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

Ars mathematica contemporanea 3 139-146 2010年
Two paths joining given vertices in 2k-edge-connected graphs

H Okamura

GRAPHS AND COMBINATORICS 21(4) 503-514 2005年12月
Two paths joining given vertices in 2k-edge-connected graphs

Harulco Okamura

Graphs and Combinatorics 21(4) 503-514 2005年12月
Two paths joining given vertices in (2k+1)-edge-connected graphs

Haruko Okamura

Ars Combinatoria 75 211-220 2005年
Two paths joining given vertices in (2k+1)-edge-connected graphs

Ars Combinatoria 75 211-220 2005年
2-reducible paths containing a specified edge in (2k+1)-edge-connected graphs

H Okamura

ARS COMBINATORIA 61 211-220 2001年10月
2-Reducible paths containing a specified edge in (2k+1)-edge-connected graphs

Ars Combinatoria 61 211-220 2001年
Six-terminal multicommodity flows in graphs

Haruko Okamura

Memoirs of Konan University Science Series 45(1) 105-114 1998年
Six-Terminal Multicommodity Flows in Graphs

Okamura Haruko

甲南大学紀要理学編 45(1) 105-114 1998年
2-Reducible cycles containing two specified edges in (2k+1)-edge-connected graphs

Haruko Okamura

Graphs and Combinatorics 11(2) 141-170 1995年
2-Reducible cycles containing three consecutive edges in (2k+1)-edge-connected graphs

Graphs and Combinatorics 11(2) 141-170 1995年
Paths containing two adjacent edges in (2k+1)-edge-connected graphs

Haruko Okamura

Discrete Mathematics 111(1-3) 401-407 1993年2月22日
Paths containing two adjacent edges in(2k+1)-edge-connected graphs

Haruko Okamura

Discrete Mathematics 111 401-407 1993年
2-Reducible cycles containing two specified edges in (2k+1)-edge-connected graphs

Haruko Okamura

Contemporary Mathematics 147 259-277 1993年
2-Reducible cycles containing two specified edges in(2k+1)-edge-connected graphs

Contemporary Mathematics 147 259-277 1993年
Counterexamples to a conjecture of Mader about cycles through specified vertices（共著）

A.Huck, H.Okamura

Graphs and Combinatorics 8(3) 253-258 1992年
Counterexamples to a conjecture of Mader about cycles through specified vertices(共著)

A.Huck, H.Okamura

Graphs and Combinatorics 8(3) 253-258 1992年
Every 4 k-edge-connected graph is Weakly 3 k-linked

Haruko Okamura

Graphs and Combinatorics 6(2) 179-185 1990年6月
EVERY 4K-EDGE-CONNECTED GRAPH IS WEAKLY 3K-LINKED

H OKAMURA

GRAPHS AND COMBINATORICS 6(2) 179-185 1990年

もっとみる

書籍等出版物

4

Cycles containing three consecutive edges in 2k-edge-connected graphs

Topics in Combinatorics and Graph Theory 1990年
Cycles containing three consecutive edges in 2k-edge-connected graphs

Topics in Combinatorics and Graph Theory 1990年
Paths and edge-connectivity in graphs II

Number Theory and combinatorics 1985年
Paths and edge-connectivity in graphs II

Number Theory and combinatorics 1985年

共同研究・競争的資金等の研究課題

4