Finding Independent Sets in Triangle-Free Graphs
From MaRDI portal
(Redirected from Publication:4717575)
Recommendations
- Counting independent sets in triangle-free graphs
- Independent dominating sets in triangle-free graphs
- Independent sets in graphs with triangles
- Minimizing the number of independent sets in triangle-free regular graphs
- Independent sets in triangle-free cubic planar graphs
- The Number of Maximal Independent Sets in Triangle-Free Graphs
- Finding independent sets in unions of perfect graphs
- Independent domination in triangle-free graphs
- scientific article; zbMATH DE number 5593359
- Counting independent sets in tricyclic graphs
Cited in
(10)- Independent sets in \(\{\text{claw}, K_4 \}\)-free 4-regular graphs
- How to guard orthogonal polygons: diagonal graphs and vertex covers
- On the complexity of the independent set problem in triangle graphs
- Independent sets in \((P_4+P_4\),triangle)-free graphs
- Turán type results for distance graphs
- Finding independent sets in \(K_4\)-free 4-regular connected graphs
- Independent triangles covering given vertices of a graph
- Independent dominating and neighborhood sets in triangular graphs
- 11/30 (Finding large independent sets in connected triangle-free 3- regular graphs)
- Independent dominating sets in triangle-free graphs
This page was built for publication: Finding Independent Sets in Triangle-Free Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4717575)
