𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Degree and stability number condition for the existence of connected factors in graphs

✍ Scribed by Jiansheng Cai; Guizhen Liu

Book ID
107619784
Publisher
Springer-Verlag
Year
2008
Tongue
English
Weight
255 KB
Volume
29
Category
Article
ISSN
1598-5865

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The stability number and connected -fact
The stability number and connected -factor in graphs
✍ Jiansheng Cai; Guizhen Liu; Jianfeng Hou πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 365 KB

Let G be a graph with vertex set V (G). In this work we present a sufficient condition for the existence of connected [k, k + 1]factors in graphs. The condition involves the stability number and degree conditions of graph G.

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.

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 k-factors
✍ Tsuyoshi Nishimura πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 358 KB πŸ‘ 1 views

## Abstract Let __k__ be an integer such that ≦, and let __G__ be a connected graph of order __n__ with ≦, __kn__ even, and minimum degree at least __k__. We prove that if __G__ satisfies max(deg(u), deg(v)) ≦ n/2 for each pair of nonadjacent vertices __u, v__ in __G__, then __G__ has a __k__‐facto

A degree sum condition for longest cycle
A degree sum condition for longest cycles in 3-connected graphs
✍ Tomoki Yamashita πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 110 KB πŸ‘ 1 views

## Abstract For a graph __G__, we denote by __d__~__G__~(__x__) and ΞΊ(__G__) the degree of a vertex __x__ in __G__ and the connectivity of __G__, respectively. In this article, we show that if __G__ is a 3‐connected graph of order __n__ such that __d__~__G__~(__x__) + __d__~__G__~(__y__) + __d__~__