Masahiro Sanka

activity

20212026

2 K_{2}

-free graphs

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

collaborators

Showing 2022 · math.COShow all

2 papers · 2 filters

math.CO2022

An Ore-type condition for hamiltonicity in tough graphs and the extremal examples

Masahiro Sanka, Songling Shan

Let $G$ be a $t$ -tough graph on $n \geq 3$ vertices for some $t > 0$ . It was shown by Bauer et al. in 1995 that if the minimum degree of $G$ is greater than $\frac{n}{t + 1} - 1$ , then $G$ …

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…

An Ore-type condition for hamiltonicity in tough graphs and the extremal examples

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

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