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...
7 KB (686 words) - 18:29, 3 November 2024
the Coxeter graph, Coxeter groups, Coxeter's loxodromic sequence of tangent circles, Coxeter–Dynkin diagrams, and the Todd–Coxeter algorithm. Coxeter was...
16 KB (1,636 words) - 01:47, 23 April 2025
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...
42 KB (4,696 words) - 05:52, 6 April 2025
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...
7 KB (585 words) - 02:39, 30 December 2024
Coxeter graph Tutte–Coxeter graph Dyck graph Klein graph Foster graph Biggs–Smith graph The Rado graph Folkman graph Gray graph Ljubljana graph Tutte...
14 KB (1,247 words) - 18:21, 11 May 2025
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...
15 KB (1,777 words) - 20:46, 11 March 2024
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...
6 KB (969 words) - 18:11, 10 February 2025
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...
7 KB (903 words) - 07:28, 19 December 2024
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...
9 KB (897 words) - 03:35, 18 May 2025
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...
27 KB (3,160 words) - 20:56, 12 March 2025
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...
5 KB (651 words) - 03:31, 11 May 2025
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...
10 KB (1,353 words) - 13:30, 3 January 2025
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...
12 KB (1,560 words) - 18:26, 9 May 2025
Petersen graph. Only five connected vertex-transitive graphs with no Hamiltonian cycles are known: the complete graph K2, the Petersen graph, the Coxeter graph...
24 KB (2,993 words) - 04:57, 12 April 2025
polyhedral 3-regular graph must be Hamiltonian; this was disproved when W. T. Tutte provided a counterexample, the Tutte graph, which is much larger...
14 KB (1,617 words) - 05:43, 5 January 2025
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...
10 KB (1,140 words) - 08:02, 29 January 2022
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...
6 KB (601 words) - 16:47, 27 December 2024
LCF notation (category Graph description languages)
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...
11 KB (635 words) - 17:43, 9 May 2025
In the mathematical field of graph theory, a graph G is symmetric or arc-transitive if, given any two ordered pairs of adjacent vertices ( u 1 , v 1 )...
11 KB (1,173 words) - 18:06, 9 May 2025
Hamiltonian path (redirect from Hamiltonian graph)
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...
19 KB (2,043 words) - 13:05, 14 May 2025
densities of graphs in graphons Tutte's conjectures: every bridgeless graph has a nowhere-zero 5-flow every Petersen-minor-free bridgeless graph has a nowhere-zero...
195 KB (20,026 words) - 13:12, 7 May 2025
Matroid (section Tutte polynomial)
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...
60 KB (8,774 words) - 11:35, 31 March 2025
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...
25 KB (3,088 words) - 15:48, 11 November 2024
W. G. Brown (category Graph theorists)
supervision of Harold Scott MacDonald Coxeter and W. T. Tutte. His dissertation was Enumeration Problems Of Linear Graph Theory (Problems in the Enumeration...
7 KB (405 words) - 00:29, 17 March 2025
(Tunny) machine; namesake of the Tutte theorem, Tutte matrix, Tutte graph, Tutte–Coxeter graph, Tutte 12-cage and Tutte fragment Abraham Robinson (professor...
42 KB (4,829 words) - 08:30, 19 August 2024
various individual (finite) graphs. The columns 'vertices', 'edges', 'radius', 'diameter', 'girth', 'P' (whether the graph is planar), χ (chromatic number)...
7 KB (85 words) - 19:28, 12 March 2024
initially specified orientation. Tutte matrix — a generalization of the Edmonds matrix for a balanced bipartite graph. Cabibbo–Kobayashi–Maskawa matrix...
32 KB (1,336 words) - 21:01, 14 April 2025
138–139. Coxeter, Harold Scott Macdonald; Sherk, F. Arthur; Canadian Mathematical Society (1995). Kaleidoscopes: Selected Writings of H.S.M. Coxeter. John...
58 KB (6,057 words) - 13:09, 22 April 2025
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...
84 KB (9,665 words) - 18:50, 11 March 2025