Takamasa Yashima
Orcid: 0000-0002-3378-4740
According to our database1,
Takamasa Yashima
authored at least 13 papers
between 2016 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Hamilton cycles passing through a matching in a bipartite graph with high degree sum.
Discret. Math., January, 2024
Discuss. Math. Graph Theory, 2024
2023
A necessary and sufficient condition for the existence of a properly coloured f-factor in an edge-coloured graph.
CoRR, 2023
2022
Degree sum condition for the existence of spanning <i>k</i>-trees in star-free graphs.
Discuss. Math. Graph Theory, 2022
2021
2020
Color degree sum conditions for properly colored spanning trees in edge-colored graphs.
Discret. Math., 2020
2019
Discret. Math., 2019
2018
Contributions Discret. Math., 2018
2017
A degree condition implying Ore-type condition for even <i>[2, b]</i>-factors in graphs.
Discuss. Math. Graph Theory, 2017
Neighborhood-union condition for an [a, b]-factor avoiding a specified Hamiltonian cycle.
Discret. Math., 2017
2016
Australas. J Comb., 2016