Description: Every friendship graph with three (different) vertices is a windmill graph. (Contributed by Alexander van der Vekens, 6-Oct-2017) (Revised by AV, 31-Mar-2021)
Ref | Expression | ||
---|---|---|---|
Hypotheses | 3vfriswmgr.v | |
|
3vfriswmgr.e | |
||
Assertion | 3vfriswmgr | |