If you made any changes in Pure these will be visible here soon.

Fingerprint Fingerprint is based on mining the text of the person's scientific documents to create an index of weighted terms, which defines the key subjects of each individual researcher.

  • 2 Similar Profiles
Ores Engineering & Materials Science
Hamiltonians Engineering & Materials Science
Graph theory Engineering & Materials Science
Fans Engineering & Materials Science

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Research Output 1999 2019

  • 225 Citations
  • 9 h-Index
  • 39 Article
  • 2 Conference contribution

Degree Conditions for Graphs to Have Spanning Trees with Few Branch Vertices and Leaves

Maezawa, S. I., Matsubara, R. & Matsuda, H., 2019 Jan 2, In : Graphs and Combinatorics. 35, 1, p. 231-238 8 p.

Research output: Contribution to journalArticle

A spanning k-spider in a graph

Matsubara, R., Matsuda, H. & Matsumura, H., 2018 Jan 1, In : Ars Combinatoria. 136, p. 247-253 7 p.

Research output: Contribution to journalArticle

9 Citations

Spanning Trees with a Bounded Number of Branch Vertices in a Claw-Free Graph

Matsuda, H., Ozeki, K. & Yamashita, T., 2014 Mar, In : Graphs and Combinatorics. 30, 2, p. 429-437 9 p.

Research output: Contribution to journalArticle

2 Citations

Spanning k-ended trees of bipartite graphs

Kano, M., Matsuda, H., Tsugaki, M. & Yan, G., 2013, In : Discrete Mathematics. 313, 24, p. 2903-2907 5 p.

Research output: Contribution to journalArticle

Spanning trees with a bounded number of leaves in a claw-free graph

Kano, M., Kyaw, A., Matsuda, H., Ozeki, K., Saito, A. & Yamashita, T., 2012 Jan, In : Ars Combinatoria. 103, p. 137-154 18 p.

Research output: Contribution to journalArticle