T. Yamashita

activity

20162024

most citedMinimum degree conditions for the existence of cycles of all lengths modulo

k

in graphs

3 citations · 3 across the 4 of their papers we have counts for

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2020

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…

math.CO2019★ 3 cited

Minimum degree conditions for the existence of cycles of all lengths modulo $k$ in graphs

Shuya Chiba, Tomoki Yamashita

Thomassen, in 1983, conjectured that for a positive integer $k$ , every $2$ -connected non-bipartite graph of minimum degree at least $k + 1$ contains cycles of all lengths modulo $k…

math.CO2018

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 $G$ is a $k$ -connected graph such that $σ_{k + 1} (G) \geq ∣ V (G) ∣ + κ (G) + (k - 2) (α (G) - 1)$ …

math.CO2016

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 $D$ is a digraph of order $n$ , and if $d_{D}^{+} (u) + d_{D}^{-} (v) \geq n$ for every two distinct vertices $u$ and $v$ with $(u, v) \…