Haruko Okamura

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Degree sum conditions for cyclability in bipartite graphs Graphs and Combinatorics	2013-07-19	Paper
Immersing small complete graphs Ars Mathematica Contemporanea	2011-03-28	Paper
2-reducible two paths and an edge constructing a path in (\(2k + 1\))-edge-connected graphs Graphs and Combinatorics	2010-11-12	Paper
Two paths joining given vertices in \(2k\)-edge-connected graphs Graphs and Combinatorics	2006-06-16	Paper
scientific article; zbMATH DE number 2192206 (Why is no real title available?)	2005-08-04	Paper
scientific article; zbMATH DE number 2188367 (Why is no real title available?)	2005-07-26	Paper
scientific article; zbMATH DE number 1327275 (Why is no real title available?)	1999-08-23	Paper
2-reducible cycles containing three consecutive edges in \((2k+1)\)-edge- connected graphs Graphs and Combinatorics	1995-08-27	Paper
Paths containing two adjacent edges in \((2k+1)\)-edge-connected graphs Discrete Mathematics	1994-05-24	Paper
scientific article; zbMATH DE number 475593 (Why is no real title available?)	1994-01-06	Paper
Counterexamples to a conjecture of Mader about cycles through specified vertices in \(n\)-edge-connected graphs Graphs and Combinatorics	1993-01-16	Paper
Every 4k-edge-connected graph is weakly 3k-linked Graphs and Combinatorics	1990-01-01	Paper
scientific article; zbMATH DE number 4177105 (Why is no real title available?)	1990-01-01	Paper
Paths and edge-connectivity in graphs. III: Six-terminal k paths Graphs and Combinatorics	1987-01-01	Paper
scientific article; zbMATH DE number 3991542 (Why is no real title available?)	1985-01-01	Paper
Paths and edge-connectivity in graphs Journal of Combinatorial Theory. Series B	1984-01-01	Paper
scientific article; zbMATH DE number 3947966 (Why is no real title available?)	1984-01-01	Paper
Multicommodity flows in graphs Discrete Applied Mathematics	1983-01-01	Paper
Three commodity flows in graphs Proceedings of the Japan Academy. Series A	1983-01-01	Paper
Hamiltonian circuits on simple 3-polytopes with up to 30 vertices Journal of the Mathematical Society of Japan	1982-01-01	Paper
Every simple 3-polytope of order 32 or less is Hamiltonian Journal of Graph Theory	1982-01-01	Paper
Multicommodity flows in planar graphs Journal of Combinatorial Theory. Series B	1981-01-01	Paper

Research outcomes over time

This page was built for person: Haruko Okamura