æz ɐ fˈaɪnaɪt kənˈɛktᵻd vˈɜːtɛkstɹˈænsᵻtˌɪv ɡɹˈæf ðæt kəntˈeɪnz nˈoʊ hˌæmɪltˈoʊniən sˈaɪkəl, ðə kˈɑːksɛɾɚ ɡɹˈæf ɪz ɐ kˈaʊntɚɹɛɡzˌæmpəl tʊ ɐ vˈɛɹiənt ʌvðə lʌvˈɑːsz kəndʒˈɛktʃɚ, bˌʌt ðə kɐnˈɑːnɪkəl fˌɔːɹmjʊlˈeɪʃən ʌvðə kəndʒˈɛktʃɚɹ ˈæsks fɚɹən hˌæmɪltˈoʊniən pˈæθ ænd ɪz vˈɛɹᵻfˌaɪd baɪ ðə kˈɑːksɛɾɚ ɡɹˈæf.
As a finite connected vertex-transitive graph that contains no Hamiltonian cycle, the Coxeter graph is a counterexample to a variant of the Lovász conjecture, but the canonical formulation of the conjecture asks for an Hamiltonian path and is verified by the Coxeter graph.