#### Filter Results:

- Full text PDF available (6)

#### Publication Year

1964

2014

- This year (0)
- Last 5 years (3)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Ken-ichi Kawarabayashi, Haruhide Matsuda, Yoshiaki Oda, Katsuhiro Ota
- Journal of Graph Theory
- 2002

- Haruhide Matsuda, Hajime Matsumura
- Graphs and Combinatorics
- 2006

- Yoshimi Egawa, Haruhide Matsuda, Tomoki Yamashita, Kiyoshi Yoshimoto
- Graphs and Combinatorics
- 2008

Let k ≥ 2 be an integer. We show that if G is a (k + 1)-connected graph and each pair of nonadjacent vertices in G has degree sum at least |G| + 1, then for each subset S of V (G) with |S| = k, G has a spanning tree such that S is the set of endvertices. This result generalizes Ore's theorem which guarantees the existence of a Hamilton path connecting any… (More)

- Haruhide Matsuda
- Discrete Mathematics
- 2004

- Kiyoshi Ando, Yoshimi Egawa, Atsushi Kaneko, Ken-ichi Kawarabayashi, Haruhide Matsuda
- Discrete Mathematics
- 2002

- Haruhide Matsuda
- Discrete Mathematics
- 2000

- Haruhide Matsuda, Hajime Matsumura
- Discrete Mathematics
- 2005

Let G be a graph and f : V (G) → {1, 3, 5,. . .}. Then a spanning subgraph F of G is called a (1, f)-odd factor if deg F (x) ∈ {1, 3,. .. , f(x)} for all x ∈ V (G). We give some results on (1, f)-odd factors and k-critical graphs with respect to (1, f)-odd factor. We consider finite graphs without loops or multiple edges. Let G be a graph with vertex set V… (More)

- Haruhide Matsuda, Kenta Ozeki, Tomoki Yamashita
- Graphs and Combinatorics
- 2014

Let k be a non-negative integer. A branch vertex of a tree is a vertex of degree at least three. We show two sufficient conditions for a connected claw-free graph to have a spanning tree with a bounded number of branch vertices: (i) A connected claw-free graph has a spanning tree with at most k branch vertices if its independence number is at most 2k + 2.… (More)

- Haruhide Matsuda
- Discrete Mathematics
- 2005