The following pages link to Haruko Okamura (Q354450):
Displaying 15 items.
- Degree sum conditions for cyclability in bipartite graphs (Q354452) (← links)
- Three commodity flows in graphs (Q594107) (← links)
- 2-reducible two paths and an edge constructing a path in (\(2k + 1\))-edge-connected graphs (Q604983) (← links)
- Paths containing two adjacent edges in \((2k+1)\)-edge-connected graphs (Q686504) (← links)
- Paths and edge-connectivity in graphs (Q799691) (← links)
- Every 4k-edge-connected graph is weakly 3k-linked (Q920108) (← links)
- Paths and edge-connectivity in graphs. III: Six-terminal k paths (Q1101467) (← links)
- Multicommodity flows in planar graphs (Q1154916) (← links)
- Hamiltonian circuits on simple 3-polytopes with up to 30 vertices (Q1161758) (← links)
- Counterexamples to a conjecture of Mader about cycles through specified vertices in \(n\)-edge-connected graphs (Q1199122) (← links)
- Multicommodity flows in graphs (Q1838904) (← links)
- 2-reducible cycles containing three consecutive edges in \((2k+1)\)-edge- connected graphs (Q1895821) (← links)
- Two paths joining given vertices in \(2k\)-edge-connected graphs (Q2494109) (← links)
- Immersing small complete graphs (Q3085021) (← links)
- (Q3201093) (← links)
