Shuya Chiba
Orcid: 0000-0002-8616-8079
According to our database1,
Shuya Chiba
authored at least 46 papers
between 2009 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2025
Packing directed cycles of specified odd length into digraphs and alternating cycles into bipartite graphs.
Discret. Math., 2025
2023
Discret. Math., December, 2023
Appl. Math. Comput., December, 2023
Minimum degree conditions for the existence of a sequence of cycles whose lengths differ by one or two.
J. Graph Theory, June, 2023
Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles.
Discret. Appl. Math., May, 2023
Minimum Number of Edges Guaranteeing the Existence of a K<sub>1, t</sub>-Factor in a Graph.
Graphs Comb., April, 2023
2022
A Chvátal-Erdős condition for the existence of a cycle intersecting specified connected subgraphs.
Discret. Math., 2022
2021
Graphs Comb., 2021
Discret. Math., 2021
2020
J. Graph Theory, 2020
Discret. Math., 2020
2019
A Degree Sum Condition on the Order, the Connectivity and the Independence Number for Hamiltonicity.
Electron. J. Comb., 2019
2018
On Directed 2-factors in Digraphs and 2-factors Containing Perfect Matchings in Bipartite Graphs.
SIAM J. Discret. Math., 2018
Graphs Comb., 2018
Discret. Math., 2018
Discret. Appl. Math., 2018
2017
On the difference between hamilton cycles and 2-factors with a prescribed number of cycles.
Electron. Notes Discret. Math., 2017
Discret. Math., 2017
A note on degree sum conditions for 2-factors with a prescribed number of cycles in bipartite graphs.
Discret. Math., 2017
Discret. Math., 2017
Electron. J. Comb., 2017
2016
A characterization of the graphs with high degree sum that are not covered by three cycles.
Ars Comb., 2016
2015
SIAM J. Discret. Math., 2015
Electron. Notes Discret. Math., 2015
2014
Discret. Math., 2014
A degree sum condition for the existence of a path-factor.
Ars Comb., 2014
Adv. Appl. Math., 2014
2013
SIAM J. Discret. Math., 2013
Covering vertices by a specified number of disjoint cycles, edges and isolated vertices.
Discret. Math., 2013
2012
2011
2010
Graphs Comb., 2010
Australas. J Comb., 2010
Australas. J Comb., 2010
2009