Welcome to Haruhide Matsuda's Website

Profile

松田晴英, 芝浦工業大学工学部情報通信工学科, 教授

専門はグラフ理論で，特に，因子や木の構造を中心に研究しています。
また，離散幾何，数学の教材作成にも興味をもっています。

Courses

2019年度前期担当科目

微分積分第1 ガイダンス資料 No.1 No.2 No.3 No.4 No.5 No.6 No.7 No.8 No.9 No.10 No.11

線形代数第1 ガイダンス資料 No.1 No.2 No.3 No.4 No.5 No.6

確率論 ガイダンス資料 No.1 No.2 No.3 No.4 No.5

離散数学特論（大学院） ガイダンス資料 No.1 No.2 No.3 No.4 No.5

Publications

• M. Furuya, S. Maezawa, R. Matsubara, H. Matsuda, and S. Tsuchiya,
  Degree sum conditions for the existence of spanning $k$-trees in star-free graphs.
  To appear in Discussiones Mathematicae Graph Theory.
• R. Matsubara, H. Matsuda, N. Matsuo, K. Noguchi, and K. Ozeki,
  $[a,b]$-factors of graphs on surfaces.
  Discrete Mathematics 342 (2019) 1979--1988.
• S. Maezawa, R. Matsubara, and H. Matsuda,
  Degree conditions for graphs to have spanning trees with few branch vertices and leaves.
  Graphs and Combinatorics 35 (2019) 231--238.
• R. Matsubara, H. Matsumura, and H. Matsuda,
  A spanning $k$-spider in a graph.
  Ars Combinatoria 136 (2018) 247--253.
• H. Matsuda, K. Ozeki, and T. Yamashita,
  Spanning trees with a bounded number of branch vertices in a claw-free graph.
  Graphs and Combinatorics 30 (2014) 429--437.
• M. Kano, H. Matsuda, M. Tsugaki, A. Saito, and G. Yang,
  Spanning $k$-ended trees of bipartite graphs.
  Discrete Mathematics 313 (2013) 2903--2907.
• M. Kano, A. Kyaw, H. Matsuda, K. Ozeki, A. Saito, and T. Yamashita,
  Spanning trees with a bounded number of leaves in a claw-free graph.
  Ars Combinatoria 103 (2012) 137--154.
• H. Matsuda and H. Matsumura,
  Degree conditions and degree bounded trees.
  Discrete Mathematics 309 (2009) 3653--3658.
• Y. Egawa, H. Matsuda, T. Yamashita, and K. Yoshimoto,
  On a spanning tree with specified leaves.
  Graphs and Combinatorics 24 (2008) 13--18.
• M. Kano and H. Matsuda,
  A neighborhood condition for graphs to have $[a,b]$-factors III.
  Discrete Geometry, Combinatorics and Graph Theory (Lecture Notes in Computer Science) 4381 (2007) 70--78.
• H. Matsuda and H. Matsumura,
  On a $k$-tree containing specified leaves in a graph.
  Graphs and Combinatorics 22 (2006) 371--381.
• H. Matsuda,
  Fan-type results for the existence of $[a,b]$-factors.
  Discrete Mathematics 306 (2006) 688--693.
• J. Li and H. Matsuda,
  On $(g,f,n)$-critical graphs.
  Ars Combinatoria 78 (2006) 71--82.
• H. Matsuda,
  Regular factors containing a given Hamiltonian cycle.
  Combinatorial Geometry and Graph Theory (Lecture Notes in Computer Science) 3330 (2005) 123--132.
• H. Matsuda,
  Ore-type conditions for the existence of even $[2,b]$-factors.
  Discrete Mathematics 304 (2005) 51--61.
• H. Matsuda,
  On 2-edge-connected $[a,b]$-factors of graphs with Ore-type condition.
  Discrete Mathematics 296 (2005) 225--234.
• H. Matsuda,
  Neighborhood conditions for the existence of $(g,f)$-factors.
  Mathematical Journal of Ibaraki University 36 (2004) 1--4.
• H. Matsuda,
  Degree conditions for Hamiltonian graphs to have $[a,b]$-factors containing a given Hamiltonian cycle.
  Discrete Mathematics 280 (2004) 241--250.
• H. Matsuda,
  A neighborhood condition for graphs to have $[a,b]$-factors II.
  Graphs and Combinatorics 18 (2003) 763--768.
• H. Matsuda,
  Degree conditions for the existence of $[k,k+1]$-factors containing a given Hamiltonian cycle.
  Australasian Journal of Combinatorics 26 (2002) 273--282.
• K. Kawarabayashi, H. Matsuda, Y. Oda, and K. Ota,
  Path factors in cubic graphs.
  Journal of Graph Theory 39 (2002) 188--193.
• K. Ando, Y. Egawa, A. Kaneko, K. Kawarabayashi, and H. Matsuda,
  Path factors in claw-free graphs.
  Discrete Mathematics 243 (2002) 195--200.
• H. Matsuda,
  Neighborhood unions and odd factor critical graphs.
  Bulletin of Nakamura Gakuen University and Nakamura Gakuen Junior College 33 (2001) 221--224.
• M. Kano and H. Matsuda,
  Partial parity $(g,f)$-factors and subgraphs covering given vertex subsets.
  Graphs and Combinatorics 17 (2001) 501--509.
• H. Matsuda,
  A neighborhood condition for graphs to have $[a,b]$-factors.
  Discrete Mathematics 224 (2000) 289--292.
• M. Kano and H. Matsuda,
  Some results on $(1,f)$-odd factors.
  Combinatorics, Graph Theory, and Algorithms II (1999) 527--533.

Grants

• 2015–2019年度科学研究費補助金 基盤研究(C)
  研究課題「グラフの部分構造と次数を制限した木の研究」 （研究課題番号15K04980 ）
  
• 2011–2014年度科学研究費補助金 基盤研究(C)
  研究課題「グラフの因子と次数を制限した全域木の研究」 （研究課題番号23540159 ）
  
• 2007–2010年度科学研究費補助金 若手研究(B)
  研究課題「グラフの部分構造と連結因子に関する研究」 （研究課題番号19740057 ）
  
• 2004–2006年度科学研究費補助金 基盤研究(C) (分担者)
  研究課題「国際経済における複雑系数理経済モデル」 （研究課題番号16530168 ）
  
• 2003–2005年度科学研究費補助金 若手研究(B)
  研究課題「グラフの因子と連結因子」 （研究課題番号15740077 ）
  
• 2001-2002年度科学研究費補助金 若手研究(B)
  研究課題「グラフの因子理論」 （研究課題番号13740084 ）
  

Contact

E-mail: hmatsuda(at)sic.shibaura-it.ac.jp, (at)=@
研究室: 大宮キャンパス(337-8570 さいたま市見沼区深作307)，4号館5階4501-3室

Links

芝浦工業大学