A neighborhood condition for graphs to have [a, b]-factors. - Haruhide Matsuda (Discret. Math., 2000)

Partial Parity (g, f)-Factors and Subgraphs Covering Given Vertex Subsets. - Mikio Kano; Haruhide Matsuda (Graphs Comb., 2001)

Degree conditions for the existence of [k, k+1]-factors containing a given Hamiltonian cycle. - Haruhide Matsuda (Australas. J Comb., 2002)

Path factors in claw-free graphs. - Kiyoshi Ando; Yoshimi Egawa; Atsushi Kaneko; Ken-ichi Kawarabayashi; Haruhide Matsuda (Discret. Math., 2002)

A Neighborhood Condition for Graphs to Have [a, b]-Factors II. - Haruhide Matsuda (Graphs Comb., 2002)

Path factors in cubic graphs. - Ken-ichi Kawarabayashi; Haruhide Matsuda; Yoshiaki Oda; Katsuhiro Ota (J. Graph Theory, 2002)

Regular Factors Containing a Given Hamiltonian Cycle. - Haruhide Matsuda (IJCCGGT, 2003)

Degree conditions for Hamiltonian graphs to have [a, b]-factors containing a given Hamiltonian cycle. - Haruhide Matsuda (Discret. Math., 2004)

A Neighborhood Condition for Graphs to Have [ a , b ]-Factors III. - Mikio Kano; Haruhide Matsuda (CJCDGCGT, 2005)

On 2-edge-connected [a, b]-factors of graphs with Ore-type condition. - Haruhide Matsuda (Discret. Math., 2005)

Ore-type conditions for the existence of even [2, b]-factors in graphs. - Haruhide Matsuda (Discret. Math., 2005)

On (g, f, n)-Critical Graphs. - Jianxiang Li; Haruhide Matsuda (Ars Comb., 2006)

Fan-type results for the existence of [a, b]-factors. - Haruhide Matsuda (Discret. Math., 2006)

On a k-Tree Containing Specified Leaves in a Graph. - Haruhide Matsuda; Hajime Matsumura (Graphs Comb., 2006)

On a Spanning Tree with Specified Leaves. - Yoshimi Egawa; Haruhide Matsuda; Tomoki Yamashita; Kiyoshi Yoshimoto (Graphs Comb., 2008)

Degree conditions and degree bounded trees. - Haruhide Matsuda; Hajime Matsumura (Discret. Math., 2009)

Spanning trees with a bounded number of leaves in a claw-free graph. - Mikio Kano; Aung Kyaw; Haruhide Matsuda; Kenta Ozeki; Akira Saito; Tomoki Yamashita (Ars Comb., 2012)

Spanning k-ended trees of bipartite graphs. - Mikio Kano; Haruhide Matsuda; Masao Tsugaki; Guiying Yan (Discret. Math., 2013)

Spanning Trees with a Bounded Number of Branch Vertices in a Claw-Free Graph. - Haruhide Matsuda; Kenta Ozeki; Tomoki Yamashita (Graphs Comb., 2014)

A spanning k-spider in a graph. - Ryota Matsubara; Haruhide Matsuda; Hajime Matsumura (Ars Comb., 2018)

[a, b]-factors of graphs on surfaces. - Ryota Matsubara; Haruhide Matsuda; Nana Matsuo; Kenta Noguchi; Kenta Ozeki (Discret. Math., 2019)

Degree Conditions for Graphs to Have Spanning Trees with Few Branch Vertices and Leaves. - Shun-ichi Maezawa; Ryota Matsubara; Haruhide Matsuda (Graphs Comb., 2019)

A Fan-type condition for graphs to be k-leaf-connected. - Shun-ichi Maezawa; Ryota Matsubara; Haruhide Matsuda (Discret. Math., 2021)

Degree sum condition for the existence of spanning k-trees in star-free graphs. - Michitaka Furuya; Shun-ichi Maezawa; Ryota Matsubara; Haruhide Matsuda; Shoichi Tsuchiya; Takamasa Yashima (Discuss. Math. Graph Theory, 2022)