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.
Articles by others on the same topic
There are currently no matching articles.