< Back to previous view
Sign in

Chordal graphs

Last update: 15 Dec 2020  | Contains: 1371109 graphs

A chordal graph is a simple graph in which every graph cycle of length four and greater has a chord, which is an edge that is not part of the cycle but connects two vertices of the cycle. The following collection was calculated by Brendan McKay (source) and lists all connected chordal graphs up to 11 vertices. Graphs of order 3 or less were included from the Eric Weisstein's MathWorld (source).

OEIS: A048192

Collection comments

Only signed in users can post comments. Sign in here
Don't have an account yet? Register here