An induced cycle is a cycle graph appearing as an induced subgraph of a graph. The vertices of the cycle have no additional edges between them beyond the cycle edges. The term chordless cycle is also used, but conventions differ on whether that term includes triangles (West 2000, p. 225). Every triangle graph is an induced cycle.
The coil-in-the-box problem asks for the longest induced cycle in a hypercube graph.
