default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTakamasa Yashima
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]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)- [j11]Naoki Matsumoto, Kenta Noguchi, Takamasa Yashima:
Cubic graphs having only k-cycles in each 2-factor. Discuss. Math. Graph Theory 44(1): 281 (2024) - 2023
- [j10]Masao Tsugaki, Tomoki Yamashita, Takamasa Yashima:
Panconnectivity in Bipartite Graphs with Large Degree sum. Graphs Comb. 39(2): 37 (2023) - [i1]Roman Cada, Michitaka Furuya, Kenji Kimura, Kenta Ozeki, Christopher Purcell, Takamasa Yashima:
A necessary and sufficient condition for the existence of a properly coloured f-factor in an edge-coloured graph. CoRR abs/2311.09042 (2023) - 2022
- [j9]Michitaka Furuya, Shun-ichi Maezawa, Ryota Matsubara, Haruhide Matsuda, Shoichi Tsuchiya, Takamasa Yashima:
Degree sum condition for the existence of spanning k-trees in star-free graphs. Discuss. Math. Graph Theory 42(1): 5-13 (2022) - 2021
- [j8]Shun-ichi Maezawa, Masao Tsugaki, Takamasa Yashima:
Closure and Spanning Trees with Bounded Total Excess. Graphs Comb. 37(3): 805-822 (2021) - 2020
- [j7]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
- [j6]Michitaka Furuya, Takamasa Yashima:
The existence of f-forests and f-trees in graphs. Discret. Appl. Math. 254: 113-123 (2019) - [j5]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
- [j4]Takamasa Yashima:
Binding number, minimum degree and (g, f)-factors of graphs. Contributions Discret. Math. 13(2) (2018) - 2017
- [j3]Michitaka Furuya, Takamasa Yashima:
Neighborhood-union condition for an [a, b]-factor avoiding a specified Hamiltonian cycle. Discret. Math. 340(6): 1419-1425 (2017) - [j2]Shoichoi Tsuchiya, Takamasa Yashima:
A degree condition implying Ore-type condition for even [2, b]-factors in graphs. Discuss. Math. Graph Theory 37(3): 797-809 (2017) - 2016
- [j1]Takamasa Yashima:
A degree condition for graphs to be fractional ID-[a, b]-factor-critical. Australas. J Comb. 65: 191-199 (2016)
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-07-20 20:32 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:
