✦ LIBER ✦

Extensions and consequences of Chvátal-Erdős' theorem

✍ Scribed by J. van den Heuvel

Publisher: Springer Japan
Year: 1996
Tongue: English
Weight: 396 KB
Volume: 12
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf01858457

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A chvátal–erdős type condition for hamil

A chvátal–erdős type condition for hamiltonian graphs

✍ Xiaoyun Lu 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 443 KB

A short proof of Chvátal's Watchman Theo

A short proof of Chvátal's Watchman Theorem

✍ Steve Fisk 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 45 KB

The Chvátal-Erdös condition and pancycli

The Chvátal-Erdös condition and pancyclic line-graphs

✍ Abdelhamid Benhocine; Jean-Luc Fouquet 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 422 KB

An extension of the Erdős-Stone theorem

✍ B. Bollobás; Y. Kohayakawa 📂 Article 📅 1994 🏛 Springer-Verlag 🌐 English ⚖ 398 KB

On a problem of Chvátal and Erdös on hyp

On a problem of Chvátal and Erdös on hypergraphs containing no generalized simplex

✍ Peter Frankl 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 494 KB

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