The following pages link to Minimum triangle-free graphs (Q3981345):
Displaying 12 items.
- How to guard orthogonal polygons: diagonal graphs and vertex covers (Q262314) (← links)
- The Ramsey number \(R(3,K_{10}-e)\) and computational bounds for \(R(3,G)\) (Q396940) (← links)
- Independent sets in \(\{\text{claw}, K_4 \}\)-free 4-regular graphs (Q400359) (← links)
- The minimum semidefinite rank of a triangle-free graph (Q630548) (← links)
- Triangle-free circuit decompositions and Petersen minor (Q1272477) (← links)
- Finding independent sets in \(K_4\)-free 4-regular connected graphs (Q1386480) (← links)
- Independence, odd girth, and average degree (Q3005112) (← links)
- (Q3027024) (← links)
- Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths (Q3195131) (← links)
- (Q4252036) (← links)
- An invariant for minimum triangle-free graphs (Q5197603) (← links)
- Degree sum for a triangle in a graph (Q5749313) (← links)
