Search Results for ""

The Hatzel graph is a planar hypohamiltonian graph on 57 vertices that was the smallest known example of such a graph until the discovery of the Zamfirescu graph on 48 ...

The Heawood four-color graph is the 25-node planar graph illustrated above that tangles the Kempe chains in Kempe's algorithm and thus provides an example of how Kempe's ...

The Kittell graph is a planar graph on 23 nodes and 63 edges that tangles the Kempe chains in Kempe's algorithm and thus provides an example of how Kempe's supposed proof of ...

The Klein bottle crossing number of a graph G is the minimum number of crossings possible when embedding G on a Klein bottle (cf. Garnder 1986, pp. 137-138). While the ...

The Poussin graph is the 15-node planar graph illustrated above that tangles the Kempe chains in Kempe's algorithm and thus provides an example of how Kempe's supposed proof ...

The small rhombicosidodecahedral graph is a quartic graph on 60 nodes and 120 edges that corresponds to the skeleton of the small rhombicosidodecahedron, as well as the great ...

The snub cubical graph is the Archimedean graph on 24 nodes and 60 edges obtained by taking the skeleton of the snub cube. It is a quintic graph, is planar, Hamiltonian, and ...

The snub dodecahedral graph is a quintic graph on 60 nodes and 150 edges that corresponds to the skeleton of the snub dodecahedron, great inverted snub icosidodecahedron, ...

A figurate number Te_n of the form Te_n = sum_(k=1)^(n)T_k (1) = 1/6n(n+1)(n+2) (2) = (n+2; 3), (3) where T_k is the kth triangular number and (n; m) is a binomial ...

The cubic Archimedean graph on 24 nodes and 36 edges that is the skeleton of the truncated cube. It is implemented in the Wolfram Language as ...