The chordless cycle polynomial of a graph may be defined as C(x) = sum_(k = 4)^(k_max) c_k x^k, where c_k is the number of chordless cycles (of length at least four) and k_max is the length of a largest chordless cycles. Precomputed chordless cycles of many graphs are implemented in the Wolfram Language as GraphData[g, ChordlessCyclePolynomial][x].

chordless cycle | cycle chord