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…