mathematical field of graph theory, the Tutte graph is a 3-regular graph with 46 vertices and 69 edges named after W. T. Tutte. It has chromatic number...

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

The Tutte polynomial, also called the dichromate or the Tutte–Whitney polynomial, is a graph polynomial. It is a polynomial in two variables which plays...

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

In graph drawing and geometric graph theory, a Tutte embedding or barycentric embedding of a simple, 3-vertex-connected, planar graph is a crossing-free...

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

cubic graph has a Hamiltonian cycle (along the edges) through all its vertices". It was proposed by P. G. Tait (1884) and disproved by W. T. Tutte (1946)...

Given such a graph, a representation of it as a subdivision of a convex polygon into smaller convex polygons may be found using the Tutte embedding. Tait...

which was generalised to the Tutte polynomial by W. T. Tutte, both of which are important invariants in algebraic graph theory. Kempe had already drawn...

In graph theory, the Tutte matrix A of a graph G = (V, E) is a matrix used to determine the existence of a perfect matching: that is, a set of edges which...

force-directed graph-drawing", Journal of Graph Algorithms and Applications, 7 (3): 253–285, doi:10.7155/jgaa.00070, MR 2112231 Tutte, W. T. (1963), "How...

theorem. The Barnette–Bosák–Lederberg graph has a similar construction to the Tutte graph but is composed of two Tutte fragments, connected through a pentagonal...

graph Kittell graph Markström graph McGee graph Meredith graph Moser spindle Sousselier graph Poussin graph Robertson graph Sylvester graph Tutte's fragment...

computer science, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context...

In graph theory, an Eulerian trail (or Eulerian path) is a trail in a finite graph that visits every edge exactly once (allowing for revisiting vertices)...

of certain Schrödinger operators defined by the graph. The Hanani–Tutte theorem states that a graph is planar if and only if it has a drawing in which...

mathematical discipline of graph theory, the Tutte theorem, named after William Thomas Tutte, is a characterization of finite undirected graphs with perfect matchings...

\left\{(0,P(G,0)),(1,P(G,1)),\ldots ,(n,P(G,n))\right\}.} Tutte’s curiosity about which other graph invariants satisfied such recurrences led him to discover...

play a key role in Tutte's theorem on perfect matchings characterizing finite graphs that have perfect matchings and the associated Tutte–Berge formula for...

polynomial, such as the Tutte polynomial of a graph. Easily computable graph invariants are instrumental for fast recognition of graph isomorphism, or rather...

discipline of graph theory the Tutte–Berge formula is a characterization of the size of a maximum matching in a graph. It is a generalization of Tutte's theorem...

graph and the Harries–Wong graph. The Petersen graph has a girth of 5 The Heawood graph has a girth of 6 The McGee graph has a girth of 7 The Tutte–Coxeter...

branch of algebraic graph theory concerns algebraic properties of invariants of graphs, and especially the chromatic polynomial, the Tutte polynomial and knot...

In graph theory, a theorem of W. T. Tutte states that every 4-vertex-connected planar graph has a Hamiltonian cycle. It strengthens an earlier theorem...

mathematical discipline of graph theory, the dual graph of a planar graph G is a graph that has a vertex for each face of G. The dual graph has an edge for each...

Springer Science & Business Media. p. 28. ISBN 978-3-642-24488-9. Tutte, W.T. (2001), Graph Theory, Cambridge University Press, pp. 126–127, ISBN 978-0-521-79489-3...

of 27 points and the 27 orthogonal lines through them. The Tutte eight-cage is the Levi graph of the Cremona–Richmond configuration. It is also known as...

(1931), "A theorem on graphs", Annals of Mathematics, Second Series, 32 (2): 378–390, doi:10.2307/1968197, JSTOR 1968197, MR 1503003 Tutte, W. T. (1956), "A...

4-vertex-connected planar graphs Tutte's theorem on perfect matchings, a characterization of the graphs having perfect matchings Tutte's spring theorem, on the...