3 citations · 7 across the 13 of their papers we have counts for
4 papers · 1 filter
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.