津垣正男

ツガキマサオ (Masao Tsugaki)

基本情報

On essential independent sets in graphs

Jun Fujisawa, Akira Saito, Masao Tsugaki, Tomoki Yamashita, Takamasa Yashima

Discrete Applied Mathematics 385 222-227 2026年5月
Sufficient conditions for edge-colored bipartite graphs to have rainbow and properly colored spanning trees

Shinya Fujita, Mikio Kano, Shun-ichi Maezawa, Masao Tsugaki, Kiyoshi Yoshimoto

Discrete Mathematics 349(4) 114921-114921 2026年4月
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

Shuya Chiba, Masao Tsugaki, Tomoki Yamashita, Takamasa Yashima

Graphs and Combinatorics 41(6) 2025年10月18日
A spanning tree with at most k leaves in a K1,5-free graph

Pei Sun, Yuan Chen, Masahiro Kimura, Kenta Ozeki, Masao Tsugaki

Discrete Mathematics 348(6) 114411-114411 2025年6月査読有り
Hamilton cycles passing through a matching in a bipartite graph with high degree sum

Jun Fujisawa, Masao Tsugaki, Tomoki Yamashita, Takamasa Yashima

Discrete Mathematics 347(1) 113692-113692 2024年1月査読有り