AbstractIt is shown that the well-known independent set problem remains NP-complete even when restricted to graphs which contain no cycles of length less than cnk where n is the number of vertices in the graph, and c and k are constants satisfying c>0 and 0≤k<1. A polynomial time approximation algorithm for this problem is also examined
Every triangle-free planar graph on n vertices has an independent set of size at least (n + 1)/3, an...
Every triangle-free planar graph on n vertices has an independent set of size at least (n + 1)/3, an...
For an integer d 3 let (d) be the supremum over all with the property that for every > 0 there exi...
AbstractIt is shown that the well-known independent set problem remains NP-complete even when restri...
AbstractLet G be a d-regular graph with girth g, and let α be the independence number of G. We show ...
Every triangle-free planar graph on n vertices has an independent set of size at least (n + 1)/3, an...
Every triangle-free planar graph on n vertices has an independent set of size at least (n + 1)/3, an...
Every triangle-free planar graph on n vertices has an independent set of size at least (n + 1)/3, an...
Every triangle-free planar graph on n vertices has an independent set of size at least (n + 1)/3, an...
We prove a tight upper bound on the independence polynomial (and total number of independent sets) o...
Every triangle-free planar graph on n vertices has an independent set of size at least (n + 1)/3, an...
AbstractA fork is a graph that is obtained from K1,3 by subdividing one edge. It is known [6–8] that...
Every triangle-free planar graph on n vertices has an independent set of size at least (n + 1)/3, an...
AbstractA new lower bound on the independence number of a graph is established and an accompanying e...
AbstractA ρ-independent set S in a graph is parameterized by a set ρ of non-negative integers that c...
Every triangle-free planar graph on n vertices has an independent set of size at least (n + 1)/3, an...
Every triangle-free planar graph on n vertices has an independent set of size at least (n + 1)/3, an...
For an integer d 3 let (d) be the supremum over all with the property that for every > 0 there exi...
AbstractIt is shown that the well-known independent set problem remains NP-complete even when restri...
AbstractLet G be a d-regular graph with girth g, and let α be the independence number of G. We show ...
Every triangle-free planar graph on n vertices has an independent set of size at least (n + 1)/3, an...
Every triangle-free planar graph on n vertices has an independent set of size at least (n + 1)/3, an...
Every triangle-free planar graph on n vertices has an independent set of size at least (n + 1)/3, an...
Every triangle-free planar graph on n vertices has an independent set of size at least (n + 1)/3, an...
We prove a tight upper bound on the independence polynomial (and total number of independent sets) o...
Every triangle-free planar graph on n vertices has an independent set of size at least (n + 1)/3, an...
AbstractA fork is a graph that is obtained from K1,3 by subdividing one edge. It is known [6–8] that...
Every triangle-free planar graph on n vertices has an independent set of size at least (n + 1)/3, an...
AbstractA new lower bound on the independence number of a graph is established and an accompanying e...
AbstractA ρ-independent set S in a graph is parameterized by a set ρ of non-negative integers that c...
Every triangle-free planar graph on n vertices has an independent set of size at least (n + 1)/3, an...
Every triangle-free planar graph on n vertices has an independent set of size at least (n + 1)/3, an...
For an integer d 3 let (d) be the supremum over all with the property that for every > 0 there exi...
DOI
Add to ORKG