𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Bill Jackson

Book ID
103506960
Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
336 KB
Volume
43
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

A Chvátal-Erdös condition for (t, t)-fac
A Chvátal-Erdös condition for (t, t)-factors in digraphs using given arcs
✍ Pierre Fraisse; Oscar Ordaz 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 570 KB

Let D b a k-connected digraph with independence number (Y. We show that for any integers t and p such that k 3 $ti (t + 1) i-p, then any set of arcs of cardinal@ p inducing a subgraph with maximum in-and outdegree at most t is contained in a spanning subgraph which is regular of in-and out-degree t,

Chvátal-Erdős conditions for pat
Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey
✍ Bill Jackson; Oscar Ordaz 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 783 KB

We give a survey of results and conjectures concerning sufficient conditions in terms of connectivity and independence number for which a graph or digraph has various path or cyclic properties, for example hamilton path/cycle, hamilton connected, pancyclic, path/cycle covers, 2-cyclic.