K. Ota

activity

20202022

2 K_{2}

-free graphs

6 citations · 6 across the 2 of their papers we have counts for

collaborators

3 papers

math.CO2022

Some conditions for hamiltonian cycles in 1-tough $(K_{2} \cup k K_{1})$ -free graphs

Katsuhiro Ota, Masahiro Sanka

Let $k \geq 2$ be an integer. We say that a graph $G$ is $(K_{2} \cup k K_{1})$ -free if it does not contain $K_{2} \cup k K_{1}$ as an induced subgraph. Recently, Shi and Shan conjectured th…

math.CO2021★ 6 cited

Hamiltonian cycles in 2-tough $2 K_{2}$ -free graphs

Katsuhiro Ota, Masahiro Sanka

A graph $G$ is called a $2 K_{2}$ -free graph if it does not contain $2 K_{2}$ as an induced subgraph. In 2014, Broersma, Patel and Pyatkin showed that every 25-tough $2 K_{2}$ -free graph on…

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…

Some conditions for hamiltonian cycles in 1-tough (K2​∪kK1​)-free graphs

Hamiltonian cycles in 2-tough 2K2​-free graphs

Minimum degree conditions for the existence of a sequence of cycles whose lengths differ by one or two

Some conditions for hamiltonian cycles in 1-tough $(K_{2} \cup k K_{1})$ -free graphs

Hamiltonian cycles in 2-tough $2 K_{2}$ -free graphs