Induced cycle
= Induced cycle
An <induced cycle> is a <cycle in a graph> whose <vertices> induce exactly its cycle <edges>, with no <edge> between nonconsecutive <vertices>. A triangle is an <induced cycle> of length three. A <chordal graph> forbids <induced cycles> of length at least four.