The following pages link to On maximal triangle‐free graphs (Q4309986):
Displaying 17 items.
- Cycle-maximal triangle-free graphs (Q472981) (← links)
- How to decrease the diameter of triangle-free graphs (Q1307443) (← links)
- The extremal functions for triangle-free graphs with excluded minors (Q1621057) (← links)
- Frustrated triangles (Q2515578) (← links)
- Further notes on: Largest triangle-free subgraphs in powers of cycles (Q2713605) (← links)
- Minimum \(C_k\)-saturated graphs (Q2857396) (← links)
- The number of the maximal triangle-free graphs (Q2922865) (← links)
- Testing Triangle-Freeness in General Graphs (Q3629476) (← links)
- Maximal triangle‐free graphs with restrictions on the degrees (Q4277984) (← links)
- (Q4347896) (← links)
- (Q4361568) (← links)
- Triangle-Free Graphs with Large Degree (Q4372989) (← links)
- Cycle-Saturated Graphs with Minimum Number of Edges (Q4920660) (← links)
- (Q5144372) (← links)
- Saturated Graphs of Prescribed Minimum Degree (Q5366942) (← links)
- Degree sum for a triangle in a graph (Q5749313) (← links)
- The maximum number of triangles in \(F_k\)-free graphs (Q6056558) (← links)