Masao Tsugaki

(津垣正男)

Profile Information

Affiliation: Assistant professor, Faculty of Science and Technology Department of Science and Technology , Seikei University

Degree: 博士（理学）（東京理科大学）(東京理科大学)

J-GLOBAL ID: 200901010197339997
researchmap Member ID: 1000306148

Research Interests

Research Areas

Education

2000 - 2004

Graduate School of Science, Tokyo University of Science
1998 - 2000

Graduate School of Science, Tokyo University of Science
1994 - 1998

Tokyo University of Science

Papers

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, Jun, 2025 Peer-reviewed
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, Jan, 2024 Peer-reviewed
A degree condition for cycles passing through specified vertices and edges

Shuya Chiba, Masao Tsugaki, Tomoki Yamashita

Discrete Mathematics, 346(12) 113633-113633, Dec, 2023 Peer-reviewed
A spanning tree with at most k leaves in a K1,p-free graph

Kenta Ozeki, Masao Tsugaki

The Electronic Journal of Combinatorics, 30(4), Nov, 2023 Peer-reviewed
Panconnectivity in Bipartite Graphs with Large Degree sum

Masao Tsugaki, Tomoki Yamashita, Takamasa Yashima

Graphs and Combinatorics, 39(2), Mar 28, 2023 Peer-reviewed
A Chvátal-Erdős condition for the existence of a cycle intersecting specified connected subgraphs

Shuya Chiba, Masao Tsugaki, Tomoki Yamashita

Discrete Mathematics, 345(6) 112808-112808, Jun, 2022 Peer-reviewed
Rainbow and Properly Colored Spanning Trees in Edge-Colored Bipartite Graphs.

Mikio Kano, Masao Tsugaki

Graphs and Combinatorics, 37(5) 1913-1921, 2021 Peer-reviewed
Spanning Bipartite Graphs with Large Degree Sum in Graphs of Odd Order.

Shuya Chiba, Akira Saito, Masao Tsugaki, Tomoki Yamashita

Graphs and Combinatorics, 37(5) 1841-1858, 2021 Peer-reviewed
Closure and Spanning Trees with Bounded Total Excess.

Shun-ichi Maezawa, Masao Tsugaki, Takamasa Yashima

Graphs and Combinatorics, 37(3) 805-822, 2021 Peer-reviewed
Spanning bipartite graphs with high degree sum in graphs

Guantao Chen, Shuya Chiba, Ronal, J. Gould, Xiaofeng Gu, Akira Saito, Masao Tsugaki, Tomoki Yamashita

Discrete Mathematics, 343(2) 111663-111663, Feb, 2020 Peer-reviewed
Color degree sum conditions for properly colored spanning trees in edge-colored graphs.

Mikio Kano, Shun-ichi Maezawa, Katsuhiro Ota, Masao Tsugaki, Takamasa Yashima

Discrete Mathematics, 343(11) 112042-112042, 2020 Peer-reviewed
On a spanning tree with specified leaves in a bipartite graph.

Masao Tsugaki, Tomoki Yamashita

Australasian Journal of Combinatorics, 77 69-86, 2020 Peer-reviewed
A degree sum condition on the order, the connectivity and the independence number for Hamiltonicity

Tomoki Shuya Chiba, Michitaka Furuya, Kenta Ozeki, Masao Tsugaki, Tomoki Yamashita

Electronic Journal of Combinatorics, 26(4) 4-4, Dec, 2019 Peer-reviewed
On 2-factors with a specified number of components in line graphs

Shuya Chiba, Yoshimi Egawa, Jun Fujisawa, Akira Saito, Ingo Schiermeyer, Masao Tsugaki, Tomoki Yamashita

Acta Mathematica Universitatis Comenianae, 88(3) 541-546, Sep, 2019 Peer-reviewed
A degree sum condition for the existence of an S-path-system in a bipartite graph.

Masao Tsugaki, Takamasa Yashima

Discrete Mathematics, 342(8) 2429-2438, 2019 Peer-reviewed
A note on a spanning (α, β)-ended tree in a bipartite graph.

Masao Tsugaki

Graphs and Combinatorics, 34(4) 693-701, 2018 Peer-reviewed
On 3-stable number conditions in n-connected claw-free graphs.

Zheng Yan 0006, Masao Tsugaki

Discrete Mathematics, 341(9) 2499-2507, 2018 Peer-reviewed
Degree sum conditions for path-factors with specified end vertices in bipartite graphs

Ryota Matsubara, Hajime Matsumura, Masao Tsugaki, Tomoki Yamashita

DISCRETE MATHEMATICS, 340(2) 87-95, Feb, 2017 Peer-reviewed
m-dominating k-ended trees of l-connected graphs.

Masao Tsugaki, Guiying Yan

AKCE International Journal of Graphs and Combinatorics, 14(3) 277-286, 2017 Peer-reviewed
SPANNING k-ENDED TREES OF A CLAW-FREE GRAPH

Zheng Yan, Masao Tsugaki

Advances and Applications in Discrete Mathematics, 17(4) 453-459, Nov 10, 2016 Peer-reviewed
A characterization of the graphs with high degree sum that are not covered by three cycles

Shuya Chiba, Masao Tsugaki

ARS COMBINATORIA, 128 127-163, Jul, 2016 Peer-reviewed
m-dominating k-trees of graphs

Mikio Kano, Kenta Ozeki, Masao Tsugaki, Guiying Yan

DISCRETE MATHEMATICS, 339(2) 729-736, Feb, 2016 Peer-reviewed
Spanning k-trees of Bipartite Graphs

Mikio Kano, K.Ozeki, K.Suzuki, M.Tsugaki, T.Yamashita

Electron. J. Combin., 22(1) 113-1, Jan, 2015 Peer-reviewed
m-dominating k-ended trees of graphs

Mikio Kano, Masao Tsugaki, Guiying Yan

DISCRETE MATHEMATICS, 333 1-5, Oct, 2014 Peer-reviewed
A degree sum condition for the existence of a path-factor

Shuya Chiba, Masao Tsugaki

Ars Combinatoria, 113 441-450, Oct, 2014 Peer-reviewed
Degree sum conditions for the circumference of 4-connected graphs

Shuya Chiba, Masao Tsugaki, Tomoki Yamashita

DISCRETE MATHEMATICS, 333 66-83, Oct, 2014 Peer-reviewed
Closure and Spanning k-Trees

Ryota Matsubara, Masao Tsugaki, Tomoki Yamashita

GRAPHS AND COMBINATORICS, 30(4) 957-962, Jul, 2014 Peer-reviewed
Spanning trees whose stems have a few leaves.

Masao Tsugaki, Yao Zhang

Ars Combinatoria, 114 245-256, 2014 Peer-reviewed
Improved Upper Bounds for Gallai-Ramsey Numbers of Paths and Cycles

Martin Hall, Colton Magnant, Kenta Ozeki, Masao Tsugaki

JOURNAL OF GRAPH THEORY, 75(1) 59-74, Jan, 2014 Peer-reviewed
Spanning k-ended trees of bipartite graphs

Mikio Kano, Haruhide Matsuda, Masao Tsugaki, Guiying Yan

DISCRETE MATHEMATICS, 313(24) 2903-2907, Dec, 2013 Peer-reviewed
Long cycles in unbalanced bipartite graphs

S.Chiba, J.Fujisawa, M.Tsugaki, T.Yamashita

Discrete Mathematics, 312 1857-1862, Jun, 2012 Peer-reviewed
A degree sum condition for graphs to be covered by two cycles

Shuya Chiba, Masao Tsugaki

Discrete Mathematics, 310 1864-1874, Jul, 2010 Peer-reviewed
A neighborhood and degree condition for panconnectivity

Ryota Matsubara, T.Yamashita, Masao Tsugaki

Austras. J.Combin., 47 3-10, Jun, 2010 Peer-reviewed
A k-Tree Containing Specified Vertices

Chiba Shuya, Matsubara Ryota, Ozeki Kenta, Tsugaki Masao

GRAPHS AND COMBINATORICS, 26(2) 187-205, Mar, 2010 Peer-reviewed
Relationships between the length of a longest path and the relative length

Shuya Chiba, Ryota Matsubara, Masao Tsugaki

Australas. J. Combin., 2010 Peer-reviewed
On relative length of longest paths and cycles

K.Ozeki, M.Tsugaki, T.Yamashita

J.Graph Theory, 62(3) 279-291, Nov, 2009 Peer-reviewed
Dominating cycles in graphs with high connectivity

M.Tsugaki, T.Yamashita

Ars Combin., 91 113-121, Apr, 2009 Peer-reviewed
Pairs of forbidden class of subgraphs concerning K_1,3and P₆to have a cycle containing specified vertices

Takeshi Sugiyama, Masao Tsugaki

Discussiones Mathematicae Graph Theory, 29(3) 645-645, 2009 Peer-reviewed
A note on a spanning 3-tree

Masao Tsugaki

COMBINATORICA, 29(1) 127-129, Jan, 2009 Peer-reviewed
Forbidden subgraphs and the existence of paths and cycles passing through specified vertices

u, J. Fujisawa, K. Ota, T. Sugiyama, M. Tsugaki

Discrete Mathematics, 308(24) 6111-6114, 2008 Peer-reviewed
A neighborhood and degree condition for pancyclicity and vertex pancyclicity

R.Matsubara, M.Tsugaki, T.Yamashita

Austras. J.Combin., 40 15-20, Jan, 2008 Peer-reviewed
Spanning trees with few leaves

M.Tsugaki, T.Yamashita

Graphs Combin., 23(5) 585-598, Oct, 2007 Peer-reviewed
On (t,k)-shredders in k-connected graphs

Zeev Nutov, Masao Tsugaki

ARS COMBINATORIA, 83 213-219, Apr, 2007 Peer-reviewed
Interpolation theorem on degree-factors with and without specified edges

Iwao Mizukai, Masao Tsugaki

AKCE International Journal of Graphs and Combinatorics, 2007 Peer-reviewed
(t,k)-Shredders in k-Connected Graphs

Masanori Takatou, Masao Tsugaki

43(2) 267-285, 2007 Peer-reviewed
Degree Sum Condition and Vertex-Disjoint Cycles in a graph

S.Fujita, H.Matsumura, M.Tsugaki, T.Yamashita

Austras. J.Combin., 35 237-255, Sep, 2006 Peer-reviewed
A bound on the order of a graph when both the graph and its complement are contraction-critically k-connected

Y. Egawa, M. Tsugaki

Australasian Journal of Combinatorics, 32 105-110, 2005 Peer-reviewed
Upper bound for the number of noncontractible edges in a 3-connected graph

Masao Tsugaki

Far East Journal of Applied Mathematics, 2003 Peer-reviewed
6-Shredders in 6-Connected Graphs

Masao Tsugaki

39(2) 211-224, 2003 Peer-reviewed

To the list screen