𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a 2-factor with a specified edge in a graph satisfying the Ore condition

✍ Scribed by Atsushi Kaneko; Kiyoshi Yoshimoto

Book ID
108315792
Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
215 KB
Volume
257
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A 2-factor with two components of a grap
A 2-factor with two components of a graph satisfying the Chvátal-Erdös condition
✍ Atsushi Kaneko; Kiyoshi Yoshimoto 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 142 KB 👁 1 views

## 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