default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMasao Tsugaki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j42]Jun Fujisawa, Masao Tsugaki, Tomoki Yamashita, Takamasa Yashima
:
Hamilton cycles passing through a matching in a bipartite graph with high degree sum. Discret. Math. 347(1): 113692 (2024)- 2023
- [j41]Kenta Ozeki, Masao Tsugaki:
A Spanning Tree with at Most $k$ Leaves in a $K_{1,p}$-Free Graph. Electron. J. Comb. 30(4) (2023) - [j40]Shuya Chiba, Masao Tsugaki, Tomoki Yamashita:
A degree condition for cycles passing through specified vertices and edges. Discret. Math. 346(12): 113633 (2023) - [j39]Masao Tsugaki, Tomoki Yamashita, Takamasa Yashima:
Panconnectivity in Bipartite Graphs with Large Degree sum. Graphs Comb. 39(2): 37 (2023) - 2022
- [j38]Shuya Chiba, Masao Tsugaki, Tomoki Yamashita:
A Chvátal-Erdős condition for the existence of a cycle intersecting specified connected subgraphs. Discret. Math. 345(6): 112808 (2022) - 2021
- [j37]Shun-ichi Maezawa, Masao Tsugaki, Takamasa Yashima:
Closure and Spanning Trees with Bounded Total Excess. Graphs Comb. 37(3): 805-822 (2021) - [j36]Shuya Chiba, Akira Saito, Masao Tsugaki, Tomoki Yamashita:
Spanning Bipartite Graphs with Large Degree Sum in Graphs of Odd Order. Graphs Comb. 37(5): 1841-1858 (2021) - [j35]Mikio Kano, Masao Tsugaki:
Rainbow and Properly Colored Spanning Trees in Edge-Colored Bipartite Graphs. Graphs Comb. 37(5): 1913-1921 (2021) - 2020
- [j34]Masao Tsugaki, Tomoki Yamashita:
On a spanning tree with specified leaves in a bipartite graph. Australas. J Comb. 77: 69-86 (2020) - [j33]Guantao Chen, Shuya Chiba, Ronald J. Gould, Xiaofeng Gu, Akira Saito, Masao Tsugaki, Tomoki Yamashita:
Spanning bipartite graphs with high degree sum in graphs. Discret. Math. 343(2): 111663 (2020) - [j32]Mikio Kano, Shun-ichi Maezawa, Katsuhiro Ota, Masao Tsugaki, Takamasa Yashima:
Color degree sum conditions for properly colored spanning trees in edge-colored graphs. Discret. Math. 343(11): 112042 (2020)
2010 – 2019
- 2019
- [j31]Shuya Chiba, Michitaka Furuya, Kenta Ozeki, Masao Tsugaki, Tomoki Yamashita:
A Degree Sum Condition on the Order, the Connectivity and the Independence Number for Hamiltonicity. Electron. J. Comb. 26(4): 4 (2019) - [j30]Masao Tsugaki, Takamasa Yashima:
A degree sum condition for the existence of an S-path-system in a bipartite graph. Discret. Math. 342(8): 2429-2438 (2019) - 2018
- [j29]Zheng Yan, Masao Tsugaki:
On 3-stable number conditions in n-connected claw-free graphs. Discret. Math. 341(9): 2499-2507 (2018) - [j28]Masao Tsugaki:
A note on a spanning (α, β)-ended tree in a bipartite graph. Graphs Comb. 34(4): 693-701 (2018) - 2017
- [j27]Masao Tsugaki, Guiying Yan:
m-dominating k-ended trees of l-connected graphs. AKCE Int. J. Graphs Comb. 14(3): 277-286 (2017) - [j26]Ryota Matsubara, Hajime Matsumura, Masao Tsugaki, Tomoki Yamashita:
Degree sum conditions for path-factors with specified end vertices in bipartite graphs. Discret. Math. 340(2): 87-95 (2017) - 2016
- [j25]Shuya Chiba, Masao Tsugaki:
A characterization of the graphs with high degree sum that are not covered by three cycles. Ars Comb. 128: 127-163 (2016) - [j24]Mikio Kano, Kenta Ozeki, Masao Tsugaki, Guiying Yan:
m-dominating k-trees of graphs. Discret. Math. 339(2): 729-736 (2016) - 2015
- [j23]Mikio Kano, Kenta Ozeki, Kazuhiro Suzuki, Masao Tsugaki, Tomoki Yamashita:
Spanning $k$-trees of Bipartite Graphs. Electron. J. Comb. 22(1): 1 (2015) - 2014
- [j22]Shuya Chiba, Masao Tsugaki:
A degree sum condition for the existence of a path-factor. Ars Comb. 113: 441-450 (2014) - [j21]Masao Tsugaki, Yao Zhang:
Spanning trees whose stems have a few leaves. Ars Comb. 114: 245-256 (2014) - [j20]Mikio Kano, Masao Tsugaki, Guiying Yan:
m-dominating k-ended trees of graphs. Discret. Math. 333: 1-5 (2014) - [j19]Shuya Chiba, Masao Tsugaki, Tomoki Yamashita:
Degree sum conditions for the circumference of 4-connected graphs. Discret. Math. 333: 66-83 (2014) - [j18]Ryota Matsubara, Masao Tsugaki, Tomoki Yamashita:
Closure and Spanning k-Trees. Graphs Comb. 30(4): 957-962 (2014) - [j17]Martin Hall, Colton Magnant, Kenta Ozeki, Masao Tsugaki:
Improved Upper Bounds for Gallai-Ramsey Numbers of Paths and Cycles. J. Graph Theory 75(1): 59-74 (2014) - 2013
- [j16]Mikio Kano, Haruhide Matsuda, Masao Tsugaki, Guiying Yan:
Spanning k-ended trees of bipartite graphs. Discret. Math. 313(24): 2903-2907 (2013) - 2012
- [j15]Shuya Chiba, Jun Fujisawa, Masao Tsugaki, Tomoki Yamashita:
Long cycles in unbalanced bipartite graphs. Discret. Math. 312(11): 1857-1862 (2012) - 2010
- [j14]Ryota Matsubara, Masao Tsugaki, Tomoki Yamashita:
A neighborhood and degree condition for panconnectivity. Australas. J Comb. 47: 3-10 (2010) - [j13]Shuya Chiba, Ryota Matsubara, Masao Tsugaki:
Relationships between the length of a longest path and the relative length. Australas. J Comb. 47: 91-108 (2010) - [j12]Shuya Chiba, Masao Tsugaki:
A degree sum condition for graphs to be covered by two cycles. Discret. Math. 310(13-14): 1864-1874 (2010) - [j11]Shuya Chiba, Ryota Matsubara, Kenta Ozeki, Masao Tsugaki:
A k-Tree Containing Specified Vertices. Graphs Comb. 26(2): 187-205 (2010)
2000 – 2009
- 2009
- [j10]Masao Tsugaki, Tomoki Yamashita:
Dominating cycles in graphs with high connectivity. Ars Comb. 91 (2009) - [j9]Masao Tsugaki:
A note on a spanning 3-tree. Comb. 29(1): 127-129 (2009) - [j8]Takeshi Sugiyama, Masao Tsugaki:
Pairs of forbidden class of subgraphs concerning K1, 3 and P6 to have a cycle containing specified vertices. Discuss. Math. Graph Theory 29(3): 645-650 (2009) - [j7]Kenta Ozeki, Masao Tsugaki, Tomoki Yamashita:
On relative length of longest paths and cycles. J. Graph Theory 62(3): 279-291 (2009) - 2008
- [j6]Ryota Matsubara, Masao Tsugaki, Tomoki Yamashita:
A neighborhood and degree condition for pancyclicity and vertex pancyclicity. Australas. J Comb. 40: 15-26 (2008) - [j5]Jun Fujisawa, Katsuhiro Ota, Takeshi Sugiyama, Masao Tsugaki:
Forbidden subgraphs and the existence of paths and cycles passing through specified vertices. Discret. Math. 308(24): 6111-6114 (2008) - 2007
- [j4]Zeev Nutov, Masao Tsugaki:
On (t, k)-shredders in k-connected graphs. Ars Comb. 83 (2007) - [j3]Masao Tsugaki, Tomoki Yamashita:
Spanning Trees with Few Leaves. Graphs Comb. 23(5): 585-598 (2007) - 2006
- [j2]Shinya Fujita, Hajime Matsumura, Masao Tsugaki, Tomoki Yamashita:
Degree sum conditions and vertex-disjoint cycles in a graph. Australas. J Comb. 35: 237-252 (2006) - 2005
- [j1]Yoshimi Egawa, Masao Tsugaki:
A bound on the order of a graph when both the graph and its complement are contraction-critically k-connected. Australas. J Comb. 32: 105-110 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
