Connected odd factors of graphs. - Nastaran Haghparast; Mikio Kano; Shun-ichi Maezawa; Kenta Ozeki (Australas. J Comb., 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)

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)

Long Paths in Bipartite Graphs and Path-Bistar Bipartite Ramsey Numbers. - Michitaka Furuya; Shun-ichi Maezawa; Kenta Ozeki (Graphs Comb., 2020)

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

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

On 3-polytopes with non-Hamiltonian prisms. - Daiki Ikegami; Shun-ichi Maezawa; Carol T. Zamfirescu (J. Graph Theory, 2021)

Special Case of Rota's Basis Conjecture on Graphic Matroids. - Shun-ichi Maezawa; Akiko Yazawa (Electron. J. Comb., 2022)

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)

Characterization of (m, n)-Linked Planar Graphs. - Kengo Enami; Shun-ichi Maezawa (Graphs Comb., 2022)

Maximum properly colored trees in edge-colored graphs. - Jie Hu; Hao Li 002; Shun-ichi Maezawa (J. Comb. Optim., 2022)

A forbidden pair for connected graphs to have spanning k-trees. - Shun-ichi Maezawa; Kenta Ozeki (J. Graph Theory, 2022)

Reconfiguration of Colorings in Triangulations of the Sphere. - Takehiro Ito; Yuni Iwamasa; Yusuke Kobayashi 001; Shun-ichi Maezawa; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki (SoCG, 2023)

Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Shun-ichi Maezawa; Yuta Nozaki; Yoshio Okamoto (ICALP, 2023)

Reconfiguration of Time-Respecting Arborescences. - Takehiro Ito; Yuni Iwamasa; Naoyuki Kamiyama; Yasuaki Kobayashi; Yusuke Kobayashi 001; Shun-ichi Maezawa; Akira Suzuki 001 (WADS, 2023)

Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams. - Takehiro Ito; Yuni Iwamasa; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Shun-ichi Maezawa; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki (ACM Trans. Algorithms, 2023)

A graph minor condition for graphs to be k-linked. - Shun-ichi Maezawa (Eur. J. Comb., 2024)

The Solitaire Clobber game and the correducibility of k-connected graphs. - Tatsuya Fujimori; Shun-ichi Maezawa; Yoshio Okamoto (Discret. Appl. Math., 2025)

An odd 4-coloring of a maximal outerplanar graph. - Masaki Kashima; Shun-ichi Maezawa; Kakeru Osako; Kenta Ozeki; Shoichi Tsuchiya (Discret. Math., 2025)

Rerouting Planar Curves and Disjoint Paths. - Takehiro Ito; Yuni Iwamasa; Naonori Kakimura; Yusuke Kobayashi 001; Shun-ichi Maezawa; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki (ACM Trans. Algorithms, 2025)