𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Independence and matching number in graphs with maximum degree 4

✍ Scribed by Joos, Felix

Book ID
121506822
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
376 KB
Volume
323
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Size and independence in triangle-free g
Size and independence in triangle-free graphs with maximum degree three
✍ Kathryn Fraughnaugh Jones πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 549 KB

## Abstract Let __C__ be the class of triangle‐free graphs with maximum degree at most three. A lower bound for the number of edges in a graph of __C__ is derived in terms of the number of vertices and the independence. Several classes of graphs for which this bound is attained are given. As coroll

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