AbstractStaton proved that every triangle-free graph on n vertices with maximum degree 3 has an independent set of size at least 5n/14. A simpler proof was found by Jones. We give a yet simpler proof, and use it to design a linear-time algorithm to find such an independent set
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...
Staton proved that every triangle-free graph on n vertices with maximum degree three has an independ...
AbstractIn 1979, Staton proved that every triangle-free graph G with maximum degree at most three ha...
AbstractStaton proved that every triangle-free graph on n vertices with maximum degree 3 has an inde...
We prove that every triangle-free planar graph on n vertices with maximum degree three has an indepe...
AbstractA simple polynomial-time algorithm is presented which computes independent sets of guarantee...
AbstractStaton proved that every 3-regular triangle-free graph has independence ratio at least 5/14 ...
AbstractIn 1979, Staton proved that every triangle-free graph G with maximum degree at most three ha...
AbstractWe prove that a K4-free graph G of order n, size m and maximum degree at most three has an i...
We prove several best-possible lower bounds in terms of the order and the average degree for the ind...
AbstractHeckman and Thomas [C.C. Heckman, R. Thomas, A new proof of the independence ratio of triang...
Recently, Davies, Jenssen, Perkins, and Roberts gave a very nice proof of the result (due, in variou...
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...
Staton proved that every triangle-free graph on n vertices with maximum degree three has an independ...
AbstractIn 1979, Staton proved that every triangle-free graph G with maximum degree at most three ha...
AbstractStaton proved that every triangle-free graph on n vertices with maximum degree 3 has an inde...
We prove that every triangle-free planar graph on n vertices with maximum degree three has an indepe...
AbstractA simple polynomial-time algorithm is presented which computes independent sets of guarantee...
AbstractStaton proved that every 3-regular triangle-free graph has independence ratio at least 5/14 ...
AbstractIn 1979, Staton proved that every triangle-free graph G with maximum degree at most three ha...
AbstractWe prove that a K4-free graph G of order n, size m and maximum degree at most three has an i...
We prove several best-possible lower bounds in terms of the order and the average degree for the ind...
AbstractHeckman and Thomas [C.C. Heckman, R. Thomas, A new proof of the independence ratio of triang...
Recently, Davies, Jenssen, Perkins, and Roberts gave a very nice proof of the result (due, in variou...
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...
DOI
Add to ORKG