265 search results - page 1 / 53 » The independence number in graphs of maximum degree three |
DM
2008
14 years 10 months ago
2008
We prove that a K4-free graph G of order n, size m and maximum degree at most three has an independent set of cardinality at least 1 7 (4n - m - - tr) where counts the number of c...
SWAT
1994
Springer
15 years 2 months ago
1994
Springer
Abstract. Finding maximum independent sets in graphs with bounded maximum degree is a well-studied NP-complete problem. We introduce an algorithm schema for improving the approxim...
JCT
2006
14 years 10 months ago
2006
: We prove that every triangle-free planar graph on n vertices with maximum degree three has an independent set with size at least 3 8 n. This was suggested and later conjectured b...
119
click to vote
PROPERTYTESTING
2010
14 years 8 months ago
2010
How well can the maximum size of an independent set, or the minimum size of a dominating set of a graph in which all degrees are at most d be approximated by a randomized constant...