A chordless cycle of a graph G is a graph cycle in G that has no cycle chord. Unfortunately, there are conflicting conventions on whether or not 3-cycles should be considered chordless. In particular, in mathematical graph theory, "trivial" cycles of length 3 are commonly not considered chordless, while in computer science, length-3 cycles are generally considered chordless (e.g., Cook et al. 2013, Wikipedia 2020). For example, states, "A chordless cycle in G is a cycle of length at least 4 in G that has no chord (that is, the cycle is an induced subgraph), while Cook et al. (2013, p. 197) states, "a triangle is considered to be a chordless cycle."

Berge graph | cactus graph | chordal graph | chordless graph | cycle chord | graph antihole | graph cycle | graph hole | odd chordless cycle | strong perfect graph theorem