Masahiro Sanka

activity

20212026

2 K_{2}

-free graphs

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

collaborators

Showing 2021Show all

2 papers · 1 filter

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…

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

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

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