𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some Ore-type conditions for the existence of connected [2,k]-factors in graphs

✍ Scribed by Rui Xu


Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
181 KB
Volume
194
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Ore-type condition for the existence of
✍ Yunsun Nam πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 130 KB

## Abstract In this article, we obtain some Ore‐type sufficient conditions for a graph to have a connected factor with degree restrictions. Let Ξ± and __k__ be positive integers with $\alpha \ge {{k + 1} \over{k - 1}}$ if ${{k}} \ge 2$ and $\alpha \ge 4$ if ${{k}}=1$. Let __G__ be a connected graph

The existence of a 2-factor in K1, n-fre
✍ R. E. L. Aldred; Yoshimi Egawa; Jun Fujisawa; Katsuhiro Ota; Akira Saito πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 130 KB πŸ‘ 1 views

In this article, we study the existence of a 2-factor in a K 1,nfree graph. Sumner [J London Math Soc 13 (1976), 351-359] proved that for n β‰₯ 4, an (n-1)-connected K 1,n -free graph of even order has a 1-factor.

A Degree Sum Condition for the Existence
✍ Matthias Kriesell πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 184 KB

It is known that a noncomplete }-connected graph of minimum degree of at least w 5} 4 x contains a }-contractible edge, i.e., an edge whose contraction yields again a }-connected graph. Here we prove the stronger statement that a noncomplete }-connected graph for which the sum of the degrees of any

Manual versus robotic assembly: Some imp
πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 248 KB

total of 10 installations exhibiting a wide range of characteristics were evaluated by different types of office workers, performing typical tasks in a simulated four-person office. The participants' evaluations were recorded by questionnaire and the results are discussed. The general conclusion is