✦ LIBER ✦

Minimum degree, independence number and regular factors

✍ Scribed by Thomas Niessen

Publisher: Springer Japan
Year: 1995
Tongue: English
Weight: 643 KB
Volume: 11
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf01787816

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Binding number and minimum degree for k-

Binding number and minimum degree for k-factors

✍ Norihide Tokushige 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 282 KB

Minimum independent generalized t-degree

Minimum independent generalized t-degree and independence number in K1,r+1-free graphs

✍ O. Favaron; Y. Redouane 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 448 KB

The minimum independent generalized t-degree of a graph G = (V,E) is ut = min{ IN(H H is an independent set of t vertices of G}, with N(H) = UxtH N(x). In a KI,~+I -free graph, we give an upper bound on u! in terms of r and the independence number CI of G. This generalizes already known results on u

On the independent domination number of

On the independent domination number of graphs with given minimum degree

✍ N.I. Glebov; A.V. Kostochka 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 175 KB

We prove a new upper bound on the independent domination number of graphs in terms of the number of vertices and the minimum degree. This bound is slightly better than that of Haviland (1991) and settles the case 6 = 2 of the corresponding conjecture by Favaron (1988). @ 1998 Elsevier Science B.V. A

Independence number, connectivity, and r

Independence number, connectivity, and r-factors

✍ Tsuyoshi Nishimura 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 270 KB

We show that if r L 1 is an odd integer and G is a graph with IV(G)l even such that K ( G ) 2 ( r + 1)2/2 and (r + l)'a(G) 5 4 r ~( G ) , then G has an rfactor; if r 2 2 is even and G is a graph with K ( G ) L r(r + 2)/2 and then G has an r-factor (where K(G) and a ( G ) denote the connectivity and

Hadwiger number and chromatic number for

Hadwiger number and chromatic number for near regular degree sequences

✍ Neil Robertson; Zi-Xia Song 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 105 KB

## Abstract We consider a problem related to Hadwiger's Conjecture. Let __D__=(__d__~1~, __d__~2~, …, __d__~__n__~) be a graphic sequence with 0⩽__d__~1~⩽__d__~2~⩽···⩽__d__~__n__~⩽__n__−1. Any simple graph __G__ with __D__ its degree sequence is called a realization of __D__. Let __R__[__D__] denot

Generalized degree conditions for graphs

Generalized degree conditions for graphs with bounded independence number

✍ Ralph Faudree; Ronald J. Gould; Linda Lesniak; Terri Lindquester 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 511 KB

We consider a generalized degree condition based on the cardinality of the neighborhood union of arbitrary sets of r vertices. We show that a Dirac-type bound on this degree in conjunction with a bound on the independence number of a graph is sufficient to imply certain hamiltonian properties in gra