Shuya Chiba

Orcid: 0000-0002-8616-8079

According to our database1, Shuya Chiba authored at least 46 papers between 2009 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Packing directed cycles of specified odd length into digraphs and alternating cycles into bipartite graphs.
Discret. Math., 2025

2023
A degree condition for cycles passing through specified vertices and edges.
Discret. Math., December, 2023

Ramsey-type results for path covers and path partitions. II. digraphs.
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

Ramsey-Type Results for Path Covers and Path Partitions.
Electron. J. Comb., 2022

2021
Spanning Bipartite Graphs with Large Degree Sum in Graphs of Odd Order.
Graphs Comb., 2021

Induced Nets and Hamiltonicity of Claw-Free Graphs.
Graphs Comb., 2021

A characterization of 2-connected {K1, 3, N3, 1, 1}-free non-Hamiltonian graphs.
Discret. Math., 2021

2020
Partitioning a graph into cycles with a specified number of chords.
J. Graph Theory, 2020

On degree sum conditions for directed path-factors with a specified number of paths.
Discret. Math., 2020

Spanning bipartite graphs with high degree sum in graphs.
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

Degree Conditions for the Existence of Vertex-Disjoint Cycles and Paths: A Survey.
Graphs Comb., 2018

On degree sum conditions for 2-factors with a prescribed number of cycles.
Discret. Math., 2018

On the existence of vertex-disjoint subgraphs with high degree sum.
Discret. Appl. Math., 2018

2017
On Dominating Even Subgraphs in Cubic Graphs.
SIAM J. Discret. Math., 2017

On the difference between hamilton cycles and 2-factors with a prescribed number of cycles.
Electron. Notes Discret. Math., 2017

Vertex-disjoint copies of K<sub>1, t</sub> in K<sub>1, r</sub>-free graphs.
Discret. Math., 2017

A note on degree sum conditions for 2-factors with a prescribed number of cycles in bipartite graphs.
Discret. Math., 2017

Degree sum conditions for vertex-disjoint cycles passing through specified vertices.
Discret. Math., 2017

Forbidden Pairs with a Common Graph Generating Almost the Same Sets.
Electron. J. Comb., 2017

2016
Dominating Cycles and Forbidden Pairs Containing P<sub>5</sub>.
Graphs Comb., 2016

A characterization of the graphs with high degree sum that are not covered by three cycles.
Ars Comb., 2016

2015
A Relationship Between Thomassen's Conjecture and Bondy's Conjecture.
SIAM J. Discret. Math., 2015

Equivalence of Jackson's and Thomassen's conjectures.
J. Comb. Theory B, 2015

2-Factors in Claw-Free Graphs with Lower Bounds Cycle Lengths.
Graphs Comb., 2015

Vertex-disjoint subgraphs with high degree sums.
Electron. Notes Discret. Math., 2015

Forbidden pairs and the existence of a dominating cycle.
Discret. Math., 2015

2014
Degree sum conditions for the circumference of 4-connected graphs.
Discret. Math., 2014

A degree sum condition for the existence of a path-factor.
Ars Comb., 2014

Minimum degree conditions for vertex-disjoint even cycles in large graphs.
Adv. Appl. Math., 2014

2013
4, 5 Is Not Coverable: A Counterexample to a Conjecture of Kaiser and Škrekovski.
SIAM J. Discret. Math., 2013

Covering vertices by a specified number of disjoint cycles, edges and isolated vertices.
Discret. Math., 2013

Circumferences of 2-factors in claw-free graphs.
Discret. Math., 2013

2012
Long cycles in unbalanced bipartite graphs.
Discret. Math., 2012

2011
2-factors in claw-free graphs.
Electron. Notes Discret. Math., 2011

2010
A <i>k</i>-Tree Containing Specified Vertices.
Graphs Comb., 2010

On a Sharp Degree Sum Condition for Disjoint Chorded Cycles in Graphs.
Graphs Comb., 2010

A degree sum condition for graphs to be covered by two cycles.
Discret. Math., 2010

Relationships between the length of a longest path and the relative length.
Australas. J Comb., 2010

A 2-factor in which each cycle contains a vertex in a specified stable set.
Australas. J Comb., 2010

2009
Disjoint Even Cycles Packing.
Electron. Notes Discret. Math., 2009


  Loading...