Module famous 

Famous named graphs (ALGO-CN-020).

Counterpart of igraph_famous() in references/igraph/src/constructors/famous.c:423-498. Given a case-insensitive name, returns the canonical labelled copy of one of 31 small graphs that appear repeatedly in graph-theory literature (Bull, Chvátal, Coxeter, Cubical, Diamond, Dodecahedron, Folkman, Franklin, Frucht, Grötzsch, Heawood, Herschel, House, HouseX, Icosahedron, Krackhardt Kite, Levi, McGee, Meredith, Noperfectmatching, Nonline, Octahedron, Petersen, Robertson, Smallestcyclicgroup, Tetrahedron, Thomassen, Tutte, Uniquely3colorable, Walther, Zachary).

Aliases follow upstream: dodecahedral ≡ dodecahedron, grotzsch ≡ groetzsch, icosahedral ≡ icosahedron, octahedral ≡ octahedron, tetrahedral ≡ tetrahedron. Every famous graph is undirected.

The edge tables are transliterated byte-for-byte from famous.c:26-249 — each row holds [vcount, ecount, directed_flag, edge0_a, edge0_b, …] so the data layout matches igraph_i_famous() and the conformance test compares the raw ordered edge list.

Functions

famous

Build a famous named graph by name (case-insensitive).

famous_names

Canonical (lowercase) names of every famous graph supported by famous. Aliases are not duplicated here — each graph appears once under its primary name. famous itself still accepts every alias.