mathematical field of graph theory, the Tutte–Coxeter graph or Tutte eight-cage or Cremona–Richmond graph is a 3-regular graph with 30 vertices and 45...

fields of graph theory and matroid theory. Tutte's research in the field of graph theory proved to be of remarkable importance. At a time when graph theory...

Coxeter graph Tutte–Coxeter graph Dyck graph Klein graph Foster graph Biggs–Smith graph The Rado graph Folkman graph Gray graph Ljubljana graph Tutte...

girth of 7 The Tutte–Coxeter graph (Tutte eight cage) has a girth of 8 For any positive integers g and χ, there exists a graph with girth at least g...

the Coxeter graph, Coxeter groups, Coxeter's loxodromic sequence of tangent circles, Coxeter–Dynkin diagrams, and the Todd–Coxeter algorithm. Coxeter was...

Desargues graph, the Nauru graph, the Coxeter graph, the Tutte–Coxeter graph, the Dyck graph, the Foster graph and the Biggs–Smith graph. W. T. Tutte classified...

making it a square pyramidal number. The number of vertices in the Tutte–Coxeter graph. The measure of the central angle and exterior angle of a dodecagon...

distance-transitive is the Shrikhande graph, with 16 vertices and degree 6. The only graph of this type with degree three is the 126-vertex Tutte 12-cage. Complete lists...

Heawood graph, 14 vertices (3,7)-cage: the McGee graph, 24 vertices (3,8)-cage: the Tutte–Coxeter graph, 30 vertices (3,10)-cage: the Balaban 10-cage, 70...

Tetrahedral graph), K3,3, the Petersen graph, the Cubical graph, the Heawood graph, the Pappus graph, the Coxeter graph, the Tutte–Coxeter graph, the Dodecahedral...

Singleton graph also contains the odd graph O(4), the Coxeter graph, and the Tutte-Coxeter graph as subgraphs. Take any edge of the Hoffman-Singleton graph, and...

In the mathematical field of graph theory, a graph G is symmetric (or arc-transitive) if, given any two pairs of adjacent vertices u1—v1 and u2—v2 of...

Coxeter graph with 28 vertices. In 2009, Pegg and Exoo conjectured that the smallest cubic graph with crossing number 13 is the Tutte–Coxeter graph and the...

the complete bipartite graphs Kn,n with girth four, the Heawood graph with degree 3 and girth 6, and the Tutte–Coxeter graph with degree 3 and girth...

Petersen graph. Only five connected vertex-transitive graphs with no Hamiltonian cycles are known: the complete graph K2, the Petersen graph, the Coxeter graph...

mathematical field of graph theory, LCF notation or LCF code is a notation devised by Joshua Lederberg, and extended by H. S. M. Coxeter and Robert Frucht...

as a graph, is Hamiltonian The Cayley graph of a finite Coxeter group is Hamiltonian (For more information on Hamiltonian paths in Cayley graphs, see...

is a generalized quadrangle with parameters (2,2). Its Levi graph is the Tutte–Coxeter graph. The points of the Cremona–Richmond configuration may be identified...

Ljubljana graph on 112 vertices is the Levi graph of the Ljubljana configuration. Grünbaum, Branko (2006), "Configurations of points and lines", The Coxeter Legacy...

on a set of 12 elements in 2 different ways. The Tutte–Coxeter graph: the symmetries of this graph are the automorphisms of S6. The exceptional automorphism...

polyhedral 3-regular graph must be Hamiltonian; this was disproved when W. T. Tutte provided a counterexample, the Tutte graph, which is much larger...

invariant is an evaluation of the Tutte polynomial. The Tutte polynomial T G {\displaystyle T_{G}} of a graph is the Tutte polynomial T M ( G ) {\displaystyle...

(Tunny) machine; namesake of the Tutte theorem, Tutte matrix, Tutte graph, Tutte–Coxeter graph, Tutte 12-cage and Tutte fragment Abraham Robinson (professor...

supervision of Harold Scott MacDonald Coxeter and W. T. Tutte. His dissertation was Enumeration Problems Of Linear Graph Theory (Problems in the Enumeration...

initially specified orientation. Tutte matrix — a generalization of the Edmonds matrix for a balanced bipartite graph. Cabibbo–Kobayashi–Maskawa matrix...

 138–139. Coxeter, Harold Scott Macdonald; Sherk, F. Arthur; Canadian Mathematical Society (1995). Kaleidoscopes: Selected Writings of H.S.M. Coxeter. John...

various individual (finite) graphs. The columns 'vertices', 'edges', 'radius', 'diameter', 'girth', 'P' (whether the graph is planar), χ (chromatic number)...

geometrical delights in a book by H. S. M. Coxeter; the game of Hex invented by Piet Hein and John Nash; Tutte's account of squaring the square; and many...