265 search results - page 9 / 53 » The independence number in graphs of maximum degree three |
DM
2010
14 years 11 months ago
2010
For a graph G, denote by fk(G) the smallest number of vertices that must be deleted from G so that the remaining induced subgraph has its maximum degree shared by at least k verti...
109
click to vote
FOCS
2008
IEEE
15 years 5 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
DM
2010
14 years 11 months ago
2010
We show that the firefighter problem is NP-complete for cubic graphs. We also show that given a rooted tree of maximum degree three in which every leaf is the same distance from t...
WG
2005
Springer
15 years 4 months ago
2005
Springer
We prove that for all 0 ≤ t ≤ k and d ≥ 2k, every graph G with treewidth at most k has a ‘large’ induced subgraph H, where H has treewidth at most t and every vertex in ...
SIAMCOMP
2002
14 years 11 months ago
2002
A set of vertices in a graph is a dominating set if every vertex outside the set has a neighbor in the set. The domatic number problem is that of partitioning the vertices of a gra...