𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The independence number in graphs of maximum degree three

✍ Scribed by Jochen Harant; Michael A. Henning; Dieter Rautenbach; Ingo Schiermeyer

Book ID
108113943
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
261 KB
Volume
308
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

Edge density and independence ratio in t
Edge density and independence ratio in triangle-free graphs with maximum degree three
✍ Jerrold Griggs; Owen Murphy πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 548 KB

A simple polynomial-time algorithm is presented which computes independent sets of guaranteed size in connected triangle-free noncubic graphs with maximum degree 3. Let nand m denote the number of vertices and edges, respectively, and let c '= m/n denote the edge density where c < 3/2. The algorithm