✦ LIBER ✦

Pancyclism in Chvátal-Erdös's graphs

✍ Scribed by D. Amar; I. Fournier; A. Germa

Book ID: 105309292
Publisher: Springer Japan
Year: 1991
Tongue: English
Weight: 603 KB
Volume: 7
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf01788136

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

The Chvátal–Erdös Condition for Group Co

The Chvátal–Erdös Condition for Group Connectivity in Graphs

✍ Xiaoxia Zhang, Xiangwen Li 📂 Article 📅 2013 🏛 Springer Japan 🌐 English ⚖ 312 KB

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

Pancyclic graphs and a conjecture of Bon

Pancyclic graphs and a conjecture of Bondy and Chvátal

✍ E.F Schmeichel; S.L Hakimi 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 618 KB

A Chvátal-Erdös condition for hamilton c

A Chvátal-Erdös condition for hamilton cycles in digraphs

✍ Bill Jackson 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 336 KB

A Chvátal-Erdös condition for (1,1)-fact

A Chvátal-Erdös condition for (1,1)-factors in digraphs

✍ Bill Jackson; Oscat Ordaz 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 171 KB

We show that if the independence number of a k-connected digraph D is at most k, then D has a spanning subgraph which consists of a union of vertex-disjoint directed circuits. As a corollary we determine the minimum number of edges required in a k-connected oriented graph to ensure the existence of