𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the independence number of graphs with maximum degree 3

✍ Scribed by Kanj, Iyad; Zhang, Fenghui

Book ID
122729020
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
1019 KB
Volume
478
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

On Induced Ramsey Numbers for Graphs wit
On Induced Ramsey Numbers for Graphs with Bounded Maximum Degree
✍ Tomasz Łuczak; VojtΔ›ch RΓΆdl πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 435 KB

For graphs G and H we write G wΓ„ ind H if every 2-edge colouring of G yields an induced monochromatic copy of H. The induced Ramsey number for H is defined as r ind (H)=min[ |V(G)|: G wΓ„ ind H]. We show that for every d 1 there exists an absolute constant c d such that r ind (H n, d ) n cd for every