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

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

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

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

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

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

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

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

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

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

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

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

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

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

mathematical field of graph theory, the Petersen graph is an undirected graph with 10 vertices and 15 edges. It is a small graph that serves as a useful...

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

pdf A Multilevel Algorithm for Force-Directed Graph-Drawing Tutte, W. T. (1963), "How to draw a graph", Proceedings of the London Mathematical Society...

for bipartite graphs. Hall's marriage theorem provides a characterization of bipartite graphs which have a perfect matching and the Tutte theorem provides...

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

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

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

as the problems they mention, W. T. Tutte's snark conjecture concerns the existence of Petersen graphs as graph minors of snarks; its proof has been...

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

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

a graph. The reliability polynomial, a polynomial that describes the probability of remaining connected after independent edge failures The Tutte polynomial...

{\displaystyle k} -linked. k-edge-connected graph Connectivity (graph theory) Menger's theorem Structural cohesion Tutte embedding Vertex separator Schrijver...

In the mathematical field of graph theory, the Walther graph, also called the Tutte fragment, is a planar bipartite graph with 25 vertices and 31 edges...

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

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