Some articles on cyclability:
Hypohamiltonian Graph - Generalizations
... Herz (1968) defines the cyclability of a graph as the largest number k such that every k vertices belong to a cycle the hypohamiltonian graphs are exactly the ... Schauerte Zamfirescu (2006) study the graphs with cyclability n − 2 ...
... Herz (1968) defines the cyclability of a graph as the largest number k such that every k vertices belong to a cycle the hypohamiltonian graphs are exactly the ... Schauerte Zamfirescu (2006) study the graphs with cyclability n − 2 ...
Main Site Subjects
Related Phrases
Related Words