Pages that link to "Item:Q4717575"
From MaRDI portal
The following pages link to Finding Independent Sets in Triangle-Free Graphs (Q4717575):
Displaying 12 items.
- How to guard orthogonal polygons: diagonal graphs and vertex covers (Q262314) (← links)
- Turán type results for distance graphs (Q331389) (← links)
- Independent sets in \(\{\text{claw}, K_4 \}\)-free 4-regular graphs (Q400359) (← links)
- Independent dominating sets in triangle-free graphs (Q434189) (← links)
- Independent sets in graphs with triangles (Q1349947) (← links)
- Finding independent sets in \(K_4\)-free 4-regular connected graphs (Q1386480) (← links)
- 11/30 (Finding large independent sets in connected triangle-free 3- regular graphs) (Q1898730) (← links)
- Edge density and independence ratio in triangle-free graphs with maximum degree three (Q1917491) (← links)
- Independent sets in \((P_4+P_4\),triangle)-free graphs (Q2053685) (← links)
- On the complexity of the independent set problem in triangle graphs (Q2275391) (← links)
- Independent dominating and neighborhood sets in triangular graphs (Q2837358) (← links)
- Independent triangles covering given vertices of a graph (Q5941524) (← links)
