Search Results for ""
1 - 10 of 1959 for Kittell graphSearch Results
View search results from all Wolfram sites (12506 matches)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 word "graph" has (at least) two meanings in mathematics. In elementary mathematics, "graph" refers to a function graph or "graph of a function," i.e., a plot. In a ...
The Soifer graph, illustrated above in a number of embeddings, is a planar graph on 9 nodes that tangles the Kempe chains in Kempe's algorithm and thus provides an example of ...
A planar graph G is said to be triangulated (also called maximal planar) if the addition of any edge to G results in a nonplanar graph. If the special cases of the triangle ...
An identity graph, sometimes also known as an asymmetric graph or rigid graph (Albertson and Collins 1996), is a graph possessing a single graph automorphism. The numbers of ...
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 Fritsch graph is the 9-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 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 Errera graph is the 17-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 ...
A graph cycle.
...