2020-12-292020-12-292015CASTONGUAY, Daine; DIAS, Elisângela Silva. Polynomial enumeration of chordless cycles on cyclically orientable graphs. Matematica Contemporanea, Rio de Janeiro, v. 44, p. 1-10, 2015.e- 2713-6636http://repositorio.bc.ufg.br/handle/ri/19276In a nite undirected simple graph, a chordless cycle is an induced subgraph which is a cycle. A graph is called cyclically orientable if it admits an orientation in which every chordless cycle is cyclically oriented. We propose an algorithm to enumerate all chordless cycles of such a graph. Compared to other similar algorithms, the proposed algorithm has the advantage of nding each chordless cycle only once in time complexity O(n2), where n is the number of vertices.engAcesso AbertoChordless cyclesCyclically orientable graphsArtigo