Masahiro Sanka

activity

20212026

2 K_{2}

-free graphs

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

collaborators

Showing math.COShow all

5 papers · 1 filter

math.CO2026

On hamiltonian cycles of 1-tough $(P_{2} \cup k P_{1})$ -free graphs

Masahiro Sanka

Let $k$ be a positive integer. A graph is said to be $(P_{2} \cup k P_{1})$ -free if it does not contain $P_{2} \cup k P_{1}$ as an induced subgraph. Recently, Ota and the author asked whethe…

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…

math.CO2021

Forbidden subgraphs and 2-factors in 3/2-tough graphs

Masahiro Sanka

A graph $G$ is $H$ -free if it has no induced subgraph isomorphic to $H$ , where $H$ is a graph. In this paper, we show that every $\frac{3}{2}$ -tough $(P_{4} \cup P_{10})$ -free graph…

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…

On hamiltonian cycles of 1-tough (P2​∪kP1​)-free graphs

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

Forbidden subgraphs and 2-factors in 3/2-tough graphs

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

On hamiltonian cycles of 1-tough $(P_{2} \cup k P_{1})$ -free graphs

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