A Remark on Hamiltonian Cycles
✍
Vu-Dinh-Hoa
📂
Article
📅
1992
🏛
John Wiley and Sons
🌐
English
⚖ 309 KB
## Abstract Let __G__ be an undirected and simple graph on __n__ vertices. Let ω, α and χ denote the number of components, the independence number and the connectivity number of __G. G__ is called a 1‐tough graph if ω(__G__ – __S__) ⩽ |__S__| for any subset __S__ of __V__(__G__) such that ω(__G__ −