default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTomoki Yamashita
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j51]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
- [j50]Shuya Chiba, Masao Tsugaki, Tomoki Yamashita:
A degree condition for cycles passing through specified vertices and edges. Discret. Math. 346(12): 113633 (2023) - [j49]Masao Tsugaki, Tomoki Yamashita, Takamasa Yashima:
Panconnectivity in Bipartite Graphs with Large Degree sum. Graphs Comb. 39(2): 37 (2023) - [j48]Shuya Chiba, Katsuhiro Ota, Tomoki Yamashita:
Minimum degree conditions for the existence of a sequence of cycles whose lengths differ by one or two. J. Graph Theory 103(2): 340-358 (2023) - 2022
- [j47]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
- [j46]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) - 2020
- [j45]Masao Tsugaki, Tomoki Yamashita:
On a spanning tree with specified leaves in a bipartite graph. Australas. J Comb. 77: 69-86 (2020) - [j44]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)
2010 – 2019
- 2019
- [j43]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) - 2018
- [j42]Atsuhiro Nakamoto, Yoshiaki Oda, Mamoru Watanabe, Tomoki Yamashita:
A note on two geometric paths with few crossings for points labeled by integers in the plane. Discret. Math. 341(4): 1109-1113 (2018) - [j41]Shuya Chiba, Tomoki Yamashita:
Degree Conditions for the Existence of Vertex-Disjoint Cycles and Paths: A Survey. Graphs Comb. 34(1): 1-83 (2018) - [j40]Shuya Chiba, Tomoki Yamashita:
On Directed 2-factors in Digraphs and 2-factors Containing Perfect Matchings in Bipartite Graphs. SIAM J. Discret. Math. 32(1): 394-409 (2018) - 2017
- [j39]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) - [j38]Shuya Chiba, Tomoki Yamashita:
Degree sum conditions for vertex-disjoint cycles passing through specified vertices. Discret. Math. 340(4): 678-690 (2017) - [j37]Shuya Chiba, Tomoki Yamashita:
A note on degree sum conditions for 2-factors with a prescribed number of cycles in bipartite graphs. Discret. Math. 340(12): 2871-2877 (2017) - 2015
- [j36]Mikio Kano, Kenta Ozeki, Kazuhiro Suzuki, Masao Tsugaki, Tomoki Yamashita:
Spanning $k$-trees of Bipartite Graphs. Electron. J. Comb. 22(1): 1 (2015) - [j35]Yoshimi Egawa, Jun Fujisawa, Michael D. Plummer, Akira Saito, Tomoki Yamashita:
Perfect matchings avoiding prescribed edges in a star-free graph. Discret. Math. 338(12): 2260-2274 (2015) - 2014
- [j34]Shuya Chiba, Masao Tsugaki, Tomoki Yamashita:
Degree sum conditions for the circumference of 4-connected graphs. Discret. Math. 333: 66-83 (2014) - [j33]Haruhide Matsuda, Kenta Ozeki, Tomoki Yamashita:
Spanning Trees with a Bounded Number of Branch Vertices in a Claw-Free Graph. Graphs Comb. 30(2): 429-437 (2014) - [j32]Ryota Matsubara, Masao Tsugaki, Tomoki Yamashita:
Closure and Spanning k-Trees. Graphs Comb. 30(4): 957-962 (2014) - 2013
- [j31]Haruko Okamura, Tomoki Yamashita:
Degree Sum Conditions for Cyclability in Bipartite Graphs. Graphs Comb. 29(4): 1077-1085 (2013) - [c4]Tomoki Yamashita, Tetsuo Kotoku, Shigeoki Hirai:
Objective of RT-middleware contests. ARSO 2013: 51-56 - 2012
- [j30]Mikio Kano, Aung Kyaw, Haruhide Matsuda, Kenta Ozeki, Akira Saito, Tomoki Yamashita:
Spanning trees with a bounded number of leaves in a claw-free graph. Ars Comb. 103: 137-154 (2012) - [j29]Shuya Chiba, Jun Fujisawa, Masao Tsugaki, Tomoki Yamashita:
Long cycles in unbalanced bipartite graphs. Discret. Math. 312(11): 1857-1862 (2012) - [j28]Kenta Ozeki, Tomoki Yamashita:
Length of Longest Cycles in a Graph Whose Relative Length is at Least Two. Graphs Comb. 28(6): 859-868 (2012) - [c3]Mikio Kano, Tomoki Yamashita, Zheng Yan:
Spanning Caterpillars Having at Most k Leaves. TJJCCGG 2012: 95-100 - 2011
- [j27]Kenta Ozeki, Tomoki Yamashita:
Dominating cycles in triangle-free graphs. Ars Comb. 98: 173-182 (2011) - [j26]Kenta Ozeki, Tomoki Yamashita:
Spanning Trees: A Survey. Graphs Comb. 27(1): 1-26 (2011) - 2010
- [j25]Ryota Matsubara, Masao Tsugaki, Tomoki Yamashita:
A neighborhood and degree condition for panconnectivity. Australas. J Comb. 47: 3-10 (2010) - [j24]Kenta Ozeki, Tomoki Yamashita:
A Spanning Tree with High Degree Vertices. Graphs Comb. 26(4): 591-596 (2010) - [j23]Jun Fujisawa, Hajime Matsumura, Tomoki Yamashita:
Degree Bounded Spanning Trees. Graphs Comb. 26(5): 695-720 (2010) - [j22]Shigeru Yamada, Tomoki Yamashita, Atsushi Fukuta:
Product quality prediction based on software process data with development-period estimation. Int. J. Syst. Assur. Eng. Manag. 1(1): 72-76 (2010) - [c2]Koshi Kashiwazaki, Yusuke Sugahara, Jun Iwasaki, Kazuhiro Kosuge, Shiro Kumazawa, Tomoki Yamashita:
Greenhouse Partner Robot System. ISR/ROBOTIK 2010: 1-8
2000 – 2009
- 2009
- [j21]Masao Tsugaki, Tomoki Yamashita:
Dominating cycles in graphs with high connectivity. Ars Comb. 91 (2009) - [j20]Kenta Ozeki, Tomoki Yamashita:
Hamiltonian cycles and dominating cycles passing through a linear forest. Discret. Math. 309(6): 1584-1592 (2009) - [j19]Tomoki Yamashita:
A degree sum condition with connectivity for relative length of longest paths and cycles. Discret. Math. 309(23-24): 6503-6507 (2009) - [j18]Kenta Ozeki, Masao Tsugaki, Tomoki Yamashita:
On relative length of longest paths and cycles. J. Graph Theory 62(3): 279-291 (2009) - 2008
- [j17]Ryota Matsubara, Masao Tsugaki, Tomoki Yamashita:
A neighborhood and degree condition for pancyclicity and vertex pancyclicity. Australas. J Comb. 40: 15-26 (2008) - [j16]Jun Fujisawa, Tomoki Yamashita:
Degree conditions on claws and modified claws for hamiltonicity of graphs. Discret. Math. 308(9): 1612-1619 (2008) - [j15]Tomoki Yamashita:
Degree sum and connectivity conditions for dominating cycles. Discret. Math. 308(9): 1620-1627 (2008) - [j14]Jun Fujisawa, Tomoki Yamashita:
A degree sum condition for long cycles passing through a linear forest. Discret. Math. 308(12): 2382-2388 (2008) - [j13]Ken-ichi Kawarabayashi, Kenta Ozeki, Tomoki Yamashita:
Long cycles in graphs without hamiltonian paths. Discret. Math. 308(24): 5899-5906 (2008) - [j12]Tomoki Yamashita:
On degree sum conditions for long cycles and cycles through specified vertices. Discret. Math. 308(24): 6584-6587 (2008) - [j11]Yoshimi Egawa, Haruhide Matsuda, Tomoki Yamashita, Kiyoshi Yoshimoto:
On a Spanning Tree with Specified Leaves. Graphs Comb. 24(1): 13-18 (2008) - [j10]Kenta Ozeki, Tomoki Yamashita:
A Degree Sum Condition Concerning the Connectivity and the Independence Number of a Graph. Graphs Comb. 24(5): 469-483 (2008) - [j9]Jun Fujisawa, Tomoki Yamashita:
Cycles passing through k + 1 vertices in k-connected graphs. J. Graph Theory 58(2): 179-190 (2008) - 2007
- [j8]Shinya Fujita, Akira Saito, Tomoki Yamashita:
Edge-dominating cycles in graphs. Discret. Math. 307(23): 2934-2942 (2007) - [j7]Tomoki Yamashita:
Vertex-dominating cycles in 2-connected bipartite graphs. Discuss. Math. Graph Theory 27(2): 323-332 (2007) - [j6]Masao Tsugaki, Tomoki Yamashita:
Spanning Trees with Few Leaves. Graphs Comb. 23(5): 585-598 (2007) - [j5]Tomoki Yamashita:
A degree sum condition for longest cycles in 3-connected graphs. J. Graph Theory 54(4): 277-283 (2007) - 2006
- [j4]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) - 2004
- [j3]Akira Saito, Tomoki Yamashita:
Cycles within specified distance from each vertex. Discret. Math. 278(1-3): 219-226 (2004) - 2003
- [j2]Akira Saito, Tomoki Yamashita:
A Note on Dominating Cycles in Tough Graphs. Ars Comb. 69 (2003)
1990 – 1999
- 1998
- [j1]Yoshiyuki Miwa, Hiroshi Itoh, Tomoki Yamashita, Kenichi Hirose:
Performance robot serving as communication media: development of an 'eyeball robot' investigating bodily communication. Adv. Robotics 13(3): 279-281 (1998) - [c1]Yoshiyuki Miwa, Tomoki Yamashita, Yasuhiro Kusihashi:
Emergence and share of information through communication-performance of plants in group formation. SMC 1998: 3680-3684
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-25 05: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:
