Search Results for ""

The E graph is the tree on 6 vertices illustrated above. It is isomorphic to the (3,2)-firecracker graph and 3-centipede graph. It is implemented in the Wolfram Language as ...

The Greenfield graph is the name given in this work to the 12-vertex graph illustrated above due to Greenfield (2011). This graph provided the first known example which ...

The Lemke graph is the 8-node graph with 13 edges illustrated above (Lemke and Kleitman 1989, Hurlbert 2011, Hurlbert 2013). The Lemke graph is the smallest graph that does ...

"The" H graph is the tree on 6 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["HGraph"]. The term "H-graph" is also used to refer to a ...

The antenna graph is the graph on 6 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["AntennaGraph"].

The Season 1 episode "Sacrifice" (2005) of the television crime drama NUMB3RS mentions econometrics.

The Franklin graph is the 12-vertex cubic graph shown above whose embedding on the Klein bottle divides it into regions having a minimal coloring using six colors, thus ...

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 Pasch graph is the Levi graph of the Pasch configuration. The Pasch graph is edge-transitive but not vertex-transitive, but fails to be semisymmetric since it is not ...

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 ...