activity
20162024
most citedMinimum degree conditions for the existence of cycles of all lengths modulo in graphs

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

collaborators

5 papers

physics.comp-ph2024

Accelerating crystal structure search through active learning with neural networks for rapid relaxations

Stefaan S. P. Hessmann, Kristof T. Schütt, Niklas W. A. Gebauer +3

Global optimization of crystal compositions is a significant yet computationally intensive method to identify stable structures within chemical space. The specific physical propert…

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 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…

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 is a -connected graph such that …

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 is a digraph of order , and if for every two distinct vertices and with $(u, v) \…