Chordal graph

Rarity: Common

The most frequent rarity: most Wikipedia articles become Commons.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class

Notion

Domain

Science and technology

In collections

Nobody has pulled it yet.

What Wikipedia says

In the mathematical area of graph theory, a chordal graph is one in which all cycles of four or more vertices have a chord, which is an edge that is not part of the cycle but connects two vertices of the cycle. Equivalently, every induced cycle in the graph should have exactly three vertices.

Excerpt from the Wikipedia article “Chordal graph”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Image: No machine-readable author provided. Tizio assumed (based on copyright claims)., Public domain, via Wikimedia Commons.