3 citations · 7 across the 13 of their papers we have counts for
14 papers
Ramsey-type problems on induced covers and induced partitions toward the Gyárfás-Sumner conjecture
Shuya Chiba, Michitaka Furuya
Gyárfás and Sumner independently conjectured that for every tree , there exists a function such that every -free graph satisfies…
Ramsey-type results for path covers and path partitions. II. Digraphs
Shuya Chiba, Michitaka Furuya
Recently, the authors gave Ramsey-type results for the path cover/partition number of graphs. In this paper, we continue the research about them focusing on digraphs, and find a re…
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…
A supplement to "Induced nets and Hamiltonicity of claw-free graphs"
S. Chiba, J. Fujisawa
This note supplements our paper "Induced nets and Hamiltonicity of claw-free graphs", by giving the detailed proof that were omitted in it.
On degree sum conditions for 2-factors with a prescribed number of cycles
Shuya Chiba
For a vertex subset of a graph , let be the maximum value of the degree sums of the subsets of of size . In this paper, we prove the following result: Let…
On directed 2-factors in digraphs and 2-factors containing perfect matchings in bipartite graphs
Shuya Chiba, Tomoki Yamashita
In this paper, we give the following result: If is a digraph of order , and if for every two distinct vertices and with $(u, v) \…
On the existence of vertex-disjoint subgraphs with high degree sum
Shuya Chiba, Nicolas Lichiardopol
For a graph , we denote by the minimum degree sum of two non-adjacent vertices if is non-complete; otherwise, . In this paper, we prove the fo…
Dominating cycles and forbidden pairs containing a path of order 5
Shuya Chiba, Michitaka Furuya, Shoichi Tsuchiya
A cycle is a graph is dominating if every edge of the graph is incident with a vertex of the cycle. In this paper, we investigate the characterization of the class of the forbidden…
Forbidden pairs and the existence of a dominating cycle
Shuya Chiba, Michitaka Furuya, Shoichi Tsuchiya
A cycle in a graph is called dominating if every edge of the graph is incident with a vertex of the cycle. In this paper, we investigate forbidden pairs guaranteeing the existence…