Edge-pancyclicity
Материал из WEGA
Edge-pancyclicity --- рёберная панцикличность.
A graph [math]\displaystyle{ G }[/math] is called edge-pancyclic if every edge of [math]\displaystyle{ G }[/math] lies on a cycle of every length from 4 to [math]\displaystyle{ n }[/math].
