A bound on the order of a graph when both the graph and its complement are contraction-critically k-connected. - Yoshimi Egawa; Masao Tsugaki (Australas. J Comb., 2005)

Degree sum conditions and vertex-disjoint cycles in a graph. - Shinya Fujita 001; Hajime Matsumura; Masao Tsugaki; Tomoki Yamashita (Australas. J Comb., 2006)

On (t, k)-shredders in k-connected graphs. - Zeev Nutov; Masao Tsugaki (Ars Comb., 2007)

Spanning Trees with Few Leaves. - Masao Tsugaki; Tomoki Yamashita (Graphs Comb., 2007)

A neighborhood and degree condition for pancyclicity and vertex pancyclicity. - Ryota Matsubara; Masao Tsugaki; Tomoki Yamashita (Australas. J Comb., 2008)

Forbidden subgraphs and the existence of paths and cycles passing through specified vertices. - Jun Fujisawa; Katsuhiro Ota; Takeshi Sugiyama; Masao Tsugaki (Discret. Math., 2008)

Dominating cycles in graphs with high connectivity. - Masao Tsugaki; Tomoki Yamashita (Ars Comb., 2009)

A note on a spanning 3-tree. - Masao Tsugaki (Comb., 2009)

Pairs of forbidden class of subgraphs concerning K1, 3 and P6 to have a cycle containing specified vertices. - Takeshi Sugiyama; Masao Tsugaki (Discuss. Math. Graph Theory, 2009)

On relative length of longest paths and cycles. - Kenta Ozeki; Masao Tsugaki; Tomoki Yamashita (J. Graph Theory, 2009)

Relationships between the length of a longest path and the relative length. - Shuya Chiba; Ryota Matsubara; Masao Tsugaki (Australas. J Comb., 2010)

A neighborhood and degree condition for panconnectivity. - Ryota Matsubara; Masao Tsugaki; Tomoki Yamashita (Australas. J Comb., 2010)

A degree sum condition for graphs to be covered by two cycles. - Shuya Chiba; Masao Tsugaki (Discret. Math., 2010)

A k-Tree Containing Specified Vertices. - Shuya Chiba; Ryota Matsubara; Kenta Ozeki; Masao Tsugaki (Graphs Comb., 2010)

Long cycles in unbalanced bipartite graphs. - Shuya Chiba; Jun Fujisawa; Masao Tsugaki; Tomoki Yamashita (Discret. Math., 2012)

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

A degree sum condition for the existence of a path-factor. - Shuya Chiba; Masao Tsugaki (Ars Comb., 2014)

Spanning trees whose stems have a few leaves. - Masao Tsugaki; Yao Zhang (Ars Comb., 2014)

Degree sum conditions for the circumference of 4-connected graphs. - Shuya Chiba; Masao Tsugaki; Tomoki Yamashita (Discret. Math., 2014)

m-dominating k-ended trees of graphs. - Mikio Kano; Masao Tsugaki; Guiying Yan (Discret. Math., 2014)

Closure and Spanning k-Trees. - Ryota Matsubara; Masao Tsugaki; Tomoki Yamashita (Graphs Comb., 2014)

Improved Upper Bounds for Gallai-Ramsey Numbers of Paths and Cycles. - Martin Hall; Colton Magnant; Kenta Ozeki; Masao Tsugaki (J. Graph Theory, 2014)

Spanning $k$-trees of Bipartite Graphs. - Mikio Kano; Kenta Ozeki; Kazuhiro Suzuki; Masao Tsugaki; Tomoki Yamashita (Electron. J. Comb., 2015)

A characterization of the graphs with high degree sum that are not covered by three cycles. - Shuya Chiba; Masao Tsugaki (Ars Comb., 2016)

m-dominating k-trees of graphs. - Mikio Kano; Kenta Ozeki; Masao Tsugaki; Guiying Yan (Discret. Math., 2016)

m-dominating k-ended trees of l-connected graphs. - Masao Tsugaki; Guiying Yan (AKCE Int. J. Graphs Comb., 2017)

Degree sum conditions for path-factors with specified end vertices in bipartite graphs. - Ryota Matsubara; Hajime Matsumura; Masao Tsugaki; Tomoki Yamashita (Discret. Math., 2017)

On 3-stable number conditions in n-connected claw-free graphs. - Zheng Yan 006; Masao Tsugaki (Discret. Math., 2018)

A note on a spanning (α, β)-ended tree in a bipartite graph. - Masao Tsugaki (Graphs Comb., 2018)

A Degree Sum Condition on the Order, the Connectivity and the Independence Number for Hamiltonicity. - Shuya Chiba; Michitaka Furuya; Kenta Ozeki; Masao Tsugaki; Tomoki Yamashita (Electron. J. Comb., 2019)

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

On a spanning tree with specified leaves in a bipartite graph. - Masao Tsugaki; Tomoki Yamashita (Australas. J Comb., 2020)

Spanning bipartite graphs with high degree sum in graphs. - Guantao Chen; Shuya Chiba; Ronald J. Gould; Xiaofeng Gu 002; Akira Saito; Masao Tsugaki; Tomoki Yamashita (Discret. Math., 2020)

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)

Spanning Bipartite Graphs with Large Degree Sum in Graphs of Odd Order. - Shuya Chiba; Akira Saito; Masao Tsugaki; Tomoki Yamashita (Graphs Comb., 2021)

Rainbow and Properly Colored Spanning Trees in Edge-Colored Bipartite Graphs. - Mikio Kano; Masao Tsugaki (Graphs Comb., 2021)

Closure and Spanning Trees with Bounded Total Excess. - Shun-ichi Maezawa; Masao Tsugaki; Takamasa Yashima (Graphs Comb., 2021)

A Chvátal-Erdős condition for the existence of a cycle intersecting specified connected subgraphs. - Shuya Chiba; Masao Tsugaki; Tomoki Yamashita (Discret. Math., 2022)

A Spanning Tree with at Most $k$ Leaves in a $K_{1,p}$-Free Graph. - Kenta Ozeki; Masao Tsugaki (Electron. J. Comb., 2023)

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

A degree condition for cycles passing through specified vertices and edges. - Shuya Chiba; Masao Tsugaki; Tomoki Yamashita (Discret. Math., 2023)

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)

A spanning tree with at most k leaves in a K1,5-free graph. - Pei Sun; Yuan Chen; Masahiro Kimura; Kenta Ozeki; Masao Tsugaki (Discret. Math., 2025)