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

mid-1930s. Even though Tutte's contributions to graph theory have been influential to modern graph theory and many of his theorems have been used to keep...

In topological graph theory, the Hanani–Tutte theorem is a result on the parity of edge crossings in a graph drawing. It states that every drawing in...

provided by the Tutte theorem. A generalization of Hall's theorem to bipartite hypergraphs is provided by various Hall-type theorems for hypergraphs....

discovered it: N. G. de Bruijn, Tatyana Ehrenfest, Cedric Smith and W. T. Tutte. Let G = (V, E) be a directed graph. An Eulerian circuit is a directed closed...

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

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

factor-critical. Hall's marriage theorem provides a characterization of bipartite graphs which have a perfect matching. The Tutte theorem provides a characterization...

In mathematics, the Tutte homotopy theorem, introduced by Tutte (1958), generalises the concept of "path" from graphs to matroids, and states roughly...

odd number of vertices is at most the cardinality of U. Then by the Tutte theorem G contains a perfect matching. Let Gi be a component with an odd number...