Takamasa Yashima

17 papers Journal 17
YearRankTypeTitle / Venue / Authors
2025 J jnl
Contributions to conjectures in planar graphs: Induced Substructures, Treewidth, and Dominating Sets.
CoRR
Kengo Enami, Naoki Matsumoto, Takamasa Yashima
2025 J jnl
Degree conditions of two vertices with distance two or three for the existence of a Hamilton cycle passing through a matching in a bipartite graph.
Graphs Comb.
Shuya Chiba, Masao Tsugaki, Tomoki Yamashita, Takamasa Yashima
2025 J jnl
Large induced subgraph with a given pathwidth in outerplanar graphs.
CoRR
Naoki Matsumoto, Takamasa Yashima
2025 J jnl
On the initial transition of graphs of Kirkman schedules by the partial team swap.
J. Comb. Optim.
Yusuke Kashiwagi, Masaki Yamamoto, Takamasa Yashima
2024 J jnl
Cubic graphs having only k-cycles in each 2-factor.
Discuss. Math. Graph Theory
Naoki Matsumoto, Kenta Noguchi, Takamasa Yashima
2024 J jnl
Hamilton cycles passing through a matching in a bipartite graph with high degree sum.
Discret. Math.
Jun Fujisawa, Masao Tsugaki, Tomoki Yamashita, Takamasa Yashima
2023 J jnl
A necessary and sufficient condition for the existence of a properly coloured f-factor in an edge-coloured graph.
CoRR
Roman Cada, Michitaka Furuya, Kenji Kimura, Kenta Ozeki, Christopher Purcell, Takamasa Yashima
2023 J jnl
Panconnectivity in Bipartite Graphs with Large Degree sum.
Graphs Comb.
Masao Tsugaki, Tomoki Yamashita, Takamasa Yashima
2022 J jnl
Degree sum condition for the existence of spanning
Discuss. Math. Graph Theory
Michitaka Furuya, Shun-ichi Maezawa, Ryota Matsubara, Haruhide Matsuda, Shoichi Tsuchiya, Takamasa Yashima
2021 J jnl
Closure and Spanning Trees with Bounded Total Excess.
Graphs Comb.
Shun-ichi Maezawa, Masao Tsugaki, Takamasa Yashima
2020 J jnl
Color degree sum conditions for properly colored spanning trees in edge-colored graphs.
Discret. Math.
Mikio Kano, Shun-ichi Maezawa, Katsuhiro Ota, Masao Tsugaki, Takamasa Yashima
2019 J jnl
A degree sum condition for the existence of an S-path-system in a bipartite graph.
Discret. Math.
Masao Tsugaki, Takamasa Yashima
2019 J jnl
The existence of f-forests and f-trees in graphs.
Discret. Appl. Math.
Michitaka Furuya, Takamasa Yashima
2018 J jnl
Binding number, minimum degree and (g, f)-factors of graphs.
Contributions Discret. Math.
Takamasa Yashima
2017 J jnl
A degree condition implying Ore-type condition for even
Discuss. Math. Graph Theory
Shoichoi Tsuchiya, Takamasa Yashima
2017 J jnl
Neighborhood-union condition for an [a, b]-factor avoiding a specified Hamiltonian cycle.
Discret. Math.
Michitaka Furuya, Takamasa Yashima
2016 J jnl
A degree condition for graphs to be fractional ID-[a, b]-factor-critical.
Australas. J Comb.
Takamasa Yashima