Haruko Okamura

Available identifiers

zbMath Open okamura.harukoMaRDI QIDQ354450

List of research outcomes

Publication	Date of Publication	Type
Degree sum conditions for cyclability in bipartite graphs	2013-07-19	Paper
Immersing small complete graphs	2011-03-28	Paper
2-reducible two paths and an edge constructing a path in (\(2k + 1\))-edge-connected graphs	2010-11-12	Paper
Two paths joining given vertices in \(2k\)-edge-connected graphs	2006-06-16	Paper
https://portal.mardi4nfdi.de/entity/Q5463585	2005-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q5461466	2005-07-26	Paper
https://portal.mardi4nfdi.de/entity/Q4259418	1999-08-23	Paper
2-reducible cycles containing three consecutive edges in \((2k+1)\)-edge- connected graphs	1995-08-27	Paper
Paths containing two adjacent edges in \((2k+1)\)-edge-connected graphs	1994-05-24	Paper
https://portal.mardi4nfdi.de/entity/Q4273849	1994-01-06	Paper
Counterexamples to a conjecture of Mader about cycles through specified vertices in \(n\)-edge-connected graphs	1993-01-16	Paper
Every 4k-edge-connected graph is weakly 3k-linked	1990-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3201093	1990-01-01	Paper
Paths and edge-connectivity in graphs. III: Six-terminal k paths	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3754024	1985-01-01	Paper
Paths and edge-connectivity in graphs	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3718456	1984-01-01	Paper
Multicommodity flows in graphs	1983-01-01	Paper
Three commodity flows in graphs	1983-01-01	Paper
Hamiltonian circuits on simple 3-polytopes with up to 30 vertices	1982-01-01	Paper
Every simple 3-polytope of order 32 or less is Hamiltonian	1982-01-01	Paper
Multicommodity flows in planar graphs	1981-01-01	Paper

Research outcomes over time

This page was built for person: Haruko Okamura