Uniquely pancyclic graph
Перейти к навигации
Перейти к поиску
Uniquely pancyclic graph --- уникально панциклический граф.
A graph [math]\displaystyle{ G }[/math] on [math]\displaystyle{ n }[/math] vertices is said to be a uniquely pancyclic graph, abbreviated UPC, if it contains exactly one cycle of every length from 3 to [math]\displaystyle{ n }[/math]. It is known that there exist only 7 graphs with less than 57 vertices.