3 citations · 4 across the 5 of their papers we have counts for
10 papers · 1 filter
Ramsey-type results for path covers and path partitions
Shuya Chiba, Michitaka Furuya
A family of subgraphs of is called a {\it path cover} (resp. a {\it path partition}) of if (resp. $\dot\bigcup _{P\in \…
Minimum degree conditions for the existence of a sequence of cycles whose lengths differ by one or two
Shuya Chiba, Katsuhiro Ota, Tomoki Yamashita
Gao, Huo, Liu and Ma (2019) proved a result on the existence of paths connecting specified two vertices whose lengths differ by one or two. By using this result, they settled two f…
Minimum degree conditions for the existence of cycles of all lengths modulo in graphs
Shuya Chiba, Tomoki Yamashita
Thomassen, in 1983, conjectured that for a positive integer , every -connected non-bipartite graph of minimum degree at least contains cycles of all lengths modulo $k…
Partitioning a graph into cycles with a specified number of chords
Shuya Chiba, Suyun Jiang, Jin Yan
For a graph , let be the minimum degree sum of two non-adjacent vertices in . A chord of a cycle in a graph is an edge of joining two non-consecutive verti…
A degree sum condition on the order, the connectivity and the independence number for Hamiltonicity
S. Chiba, M. Furuya, K. Ozeki +2
In [Graphs Combin.~24 (2008) 469--483.], the third author and the fifth author conjectured that if is a -connected graph such that …
Induced nets and Hamiltonicity of claw-free graphs
Shuya Chiba, Jun Fujisawa
The connected graph of degree sequence 3,3,3,1,1,1 is called a net, and the vertices of degree 1 in a net is called its endvertices. Broersma conjectured in 1993 that a 2-connected…