𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An ore-type condition for the existence ofk-factors in graphs

✍ Scribed by Tadashi Iida; Tsuyoshi Nishimura

Publisher
Springer Japan
Year
1991
Tongue
English
Weight
431 KB
Volume
7
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Ore-type condition for the existence of
Ore-type condition for the existence of connected factors
✍ 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

A degree condition for the existence of
A degree condition for the existence of regular factors inK1,n-free graphs
✍ Ota, Katsuhiro; Tokuda, Taro πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 260 KB πŸ‘ 2 views

A graph is called K1,.-free if it contains no K l , n as an induced subgraph. Let n ( r 3), r be integers (if r is odd, r 2 n -1). We prove that every Kl,,-free connected graph G with rlV(G)I even has an r-factor if its minimum degree is at least This degree condition is sharp.

A Degree Sum Condition for the Existence
A Degree Sum Condition for the Existence of a Contractible Edge in a ΞΊ-Connected Graph
✍ 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