A generalization of the Bondy-Chvátal theorem on the k-closure
✍ Scribed by Zhu Yong-jin; Tian Feng
- Publisher
- Elsevier Science
- Year
- 1983
- Tongue
- English
- Weight
- 368 KB
- Volume
- 35
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract Chvátal and Erdös showed that a __k__‐connected graph with independence number at most __k__ and order at least three is hamiltonian. In this paper, we show that a graph contains a 2‐factor with two components, i.e., the graph can be divided into two cycles if the graph is __k__(≥ 4)‐co
We generalize the Proximity Force Theorem of J. Btocki et al. (Ann. Phys. (N.Y.) 105 (1977), 427) (valid for gently curued surfaces) to include surfaces that may have large curvatures (but are still characterized by small angles between relevant portions of the interacting surfaces). A general proof