Triangle-free planar graphs with the smallest independence number
From MaRDI portal
Publication:4630003
Abstract: Steinberg and Tovey proved that every n-vertex planar triangle-free graph has an independent set of size at least (n+1)/3, and described an infinite class of tight examples. We show that all n-vertex planar triangle-free graphs except for this one infinite class have independent sets of size at least (n+2)/3.
Recommendations
Cited in
(10)- Large independent sets in triangle-free cubic graphs: beyond planarity
- Triangle-free planar graphs with small independence number
- On sufficient conditions for planar graphs to be 5-flexible
- Every triangle-free planar graph has a planar upward drawing
- Triangle-free geometric intersection graphs with no large independent sets
- Independent sets in triangle-free cubic planar graphs
- Planar graphs have independence ratio at least 3/13
- Large independent sets in triangle-free planar graphs
- On the tightness of the \(\frac {5}{14}\) independence ratio
- Independence number of 2-factor-plus-triangles graphs
This page was built for publication: Triangle-free planar graphs with the smallest independence number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4630003)