𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Existence of a 2-Factor in a Graph Satisfying the Local Chvátal--Erdös Condition

✍ Scribed by Chen, Guantao; Saito, Akira; Shan, Songling

Book ID
121744889
Publisher
Society for Industrial and Applied Mathematics
Year
2013
Tongue
English
Weight
211 KB
Volume
27
Category
Article
ISSN
0895-4801

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

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,