A degree condition for graphs to be fractional ID-[a, b]-factor-critical. - Takamasa Yashima (Australas. J Comb., 2016)

Neighborhood-union condition for an [a, b]-factor avoiding a specified Hamiltonian cycle. - Michitaka Furuya; Takamasa Yashima (Discret. Math., 2017)

A degree condition implying Ore-type condition for even [2, b]-factors in graphs. - Shoichoi Tsuchiya; Takamasa Yashima (Discuss. Math. Graph Theory, 2017)

Binding number, minimum degree and (g, f)-factors of graphs. - Takamasa Yashima (Contributions Discret. Math., 2018)

The existence of f-forests and f-trees in graphs. - Michitaka Furuya; Takamasa Yashima (Discret. Appl. Math., 2019)

A degree sum condition for the existence of an S-path-system in a bipartite graph. - Masao Tsugaki; Takamasa Yashima (Discret. Math., 2019)

Color degree sum conditions for properly colored spanning trees in edge-colored graphs. - Mikio Kano; Shun-ichi Maezawa; Katsuhiro Ota; Masao Tsugaki; Takamasa Yashima (Discret. Math., 2020)

Closure and Spanning Trees with Bounded Total Excess. - Shun-ichi Maezawa; Masao Tsugaki; Takamasa Yashima (Graphs Comb., 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)

A necessary and sufficient condition for the existence of a properly coloured f-factor in an edge-coloured graph. - Roman Cada; Michitaka Furuya; Kenji Kimura; Kenta Ozeki; Christopher Purcell; Takamasa Yashima (CoRR, 2023)

Panconnectivity in Bipartite Graphs with Large Degree sum. - Masao Tsugaki; Tomoki Yamashita; Takamasa Yashima (Graphs Comb., 2023)

Cubic graphs having only k-cycles in each 2-factor. - Naoki Matsumoto; Kenta Noguchi; Takamasa Yashima (Discuss. Math. Graph Theory, 2024)

Hamilton cycles passing through a matching in a bipartite graph with high degree sum. - Jun Fujisawa; Masao Tsugaki; Tomoki Yamashita; Takamasa Yashima (Discret. Math., 2024)

Large induced subgraph with a given pathwidth in outerplanar graphs. - Naoki Matsumoto; Takamasa Yashima (CoRR, 2025)

Contributions to conjectures in planar graphs: Induced Substructures, Treewidth, and Dominating Sets. - Kengo Enami; Naoki Matsumoto; Takamasa Yashima (CoRR, 2025)

On the initial transition of graphs of Kirkman schedules by the partial team swap. - Yusuke Kashiwagi; Masaki Yamamoto 001; Takamasa Yashima (J. Comb. Optim., 2025)