(a,b)-Vertex pancyclic graph

Материал из WikiGrapp
Перейти к:навигация, поиск

(a,b)-Vertex pancyclic graph --- (a,b)-вершинно панциклический граф.

Let a,b be integers and a \leq i \leq b. G is called (a,b)-vertex pancyclic, if for any u \in V there exists a cycle containing u with i vertices. In particular, G is vertex pancyclic, if a = 3 and b = |V|.