ˈoʊnli fˈaɪv ɛɡzˈæmpəlz ʌv vˈɜːtɛkstɹˈænsᵻtˌɪv ɡɹˈæf wɪð nˈoʊ hˌæmɪltˈoʊniən sˈaɪkəlz ɑːɹ nˈoʊn : ðə kəmplˈiːt ɡɹˈæf kˈeɪ tˈuː, ðə pˈiːɾɜːsən ɡɹˈæf, ðə kˈɑːksɛɾɚ ɡɹˈæf ænd tˈuː ɡɹˈæfz dᵻɹˈaɪvd fɹʌmðə pˈiːɾɜːsən ænd kˈɑːksɛɾɚ ɡɹˈæfz baɪ ɹᵻplˈeɪsɪŋ ˈiːtʃ vˈɜːtɛks wɪð ɐ tɹˈaɪæŋɡəl.
Only five examples of vertex-transitive graph with no Hamiltonian cycles are known : the complete graph K2, the Petersen graph, the Coxeter graph and two graphs derived from the Petersen and Coxeter graphs by replacing each vertex with a triangle.