๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Finding Independent Sets inK4-Free 4-Regular Connected Graphs

โœ Scribed by Stephen C. Locke; Feng Lou

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
449 KB
Volume
71
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Lower bounds on size and independence in
Lower bounds on size and independence inK4-free graphs
โœ Fraughnaugh, Kathryn L.; Locke, Stephen C. ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 131 KB ๐Ÿ‘ 1 views

We investigate lower bounds on the size of K 4 -free graphs. For several ranges of independence relative to order and for graphs with maximum degree 3 and 4, we find sharp lower bounds. We also evaluate Ramsey-type numbers over the classes of graphs with maximum degree 3 and with maximum degree 4.