• Thumbnail for Tietze's graph
    field of graph theory, Tietze's graph is an undirected cubic graph with 12 vertices and 18 edges. It is named after Heinrich Franz Friedrich Tietze, who showed...
    6 KB (666 words) - 07:43, 18 July 2024
  • regular graphs are vertex-transitive (for example, the Frucht graph and Tietze's graph). Finite vertex-transitive graphs include the symmetric graphs (such...
    6 KB (636 words) - 22:09, 26 January 2024
  • theorem Tietze's graph Tietze transformation in mathematics, named after Heinrich Tietze Tietze syndrome in medicine, named after Alexander Tietze This disambiguation...
    386 bytes (70 words) - 19:54, 31 October 2023
  • Thumbnail for Heinrich Tietze
    developed the Tietze transformations for group presentations, and was the first to pose the group isomorphism problem. Tietze's graph is also named after...
    6 KB (458 words) - 07:37, 12 June 2024
  • Thumbnail for Möbius strip
    vertices of these six regions form Tietze's graph, which is a dual graph on this surface for the six-vertex complete graph but cannot be drawn without crossings...
    87 KB (9,589 words) - 06:12, 15 June 2024
  • Thumbnail for Snark (graph theory)
    notable cubic non-three-edge-colorable graph is Tietze's graph, with 12 vertices; as Heinrich Franz Friedrich Tietze discovered in 1910, it forms the boundary...
    23 KB (2,707 words) - 07:38, 22 July 2024
  • Franklin graph Frucht graph Goldner–Harary graph Golomb graph Grötzsch graph Harries graph Harries–Wong graph Herschel graph Hoffman graph Holt graph Horton...
    14 KB (1,251 words) - 14:50, 13 March 2024
  • Thumbnail for Cubic graph
    a Tait coloring are known as snarks. They include the Petersen graph, Tietze's graph, the Blanuša snarks, the flower snark, the double-star snark, the...
    15 KB (1,777 words) - 20:46, 11 March 2024
  • Thumbnail for Four color theorem
    Four color theorem (category Graph coloring)
    colors. The vertices and edges of the subdivision form an embedding of Tietze's graph onto the strip. Interactive Szilassi polyhedron model with each of 7...
    48 KB (6,174 words) - 07:48, 18 July 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
  • Thumbnail for Flower snark
    Flower snark (category Parametric families of graphs)
    variation of the Petersen graph formed by replacing one of its vertices by a triangle. This graph is also known as the Tietze's graph. In order to avoid trivial...
    4 KB (373 words) - 07:44, 2 February 2023
  • connected 3-regular (cubic) simple graphs are listed for small vertex numbers. The number of connected simple cubic graphs on 4, 6, 8, 10, ... vertices is...
    31 KB (1,308 words) - 10:34, 15 November 2023
  • Thumbnail for Cycle double cover
    Cycle double cover (category Graph theory objects)
    such as Tietze's graph which contain triangles. Through computer searches, it is known that every cycle of length 11 or less in a cubic graph forms a...
    13 KB (1,760 words) - 03:24, 19 May 2024
  • a regular cellulation. A loopless graph is represented by a regular 1-dimensional CW-complex. A closed 2-cell graph embedding on a surface is a regular...
    22 KB (3,374 words) - 22:31, 5 April 2024
  • restriction is continuous. Closed graph theorem (functional analysis) – Theorems connecting continuity to closure of graphs Densely defined operator – Function...
    8 KB (1,183 words) - 13:13, 1 June 2024
  • Thumbnail for Uniform continuity
    functions, the graph might lie inside the height of the rectangle at some point on the graph but there is a point on the graph where the graph lies above...
    25 KB (4,148 words) - 22:50, 14 March 2024
  • continuous function and suppose Y {\displaystyle Y} is Hausdorff. Then the graph of f {\displaystyle f} , { ( x , f ( x ) ) ∣ x ∈ X } {\displaystyle \{(x...
    16 KB (2,174 words) - 11:54, 28 February 2024
  • 0–9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 2-factor theorem (graph theory) 15 and 290 theorems (number theory) 2π theorem (Riemannian geometry)...
    72 KB (6,000 words) - 16:31, 18 July 2024
  • Thumbnail for Geometric group theory
    graphs of groups Grigorchuk group The ping-pong lemma, a useful way to exhibit a group as a free product Amenable group Nielsen transformation Tietze...
    38 KB (4,308 words) - 13:31, 7 April 2024
  • Thumbnail for Henri Lebesgue
    operation that corresponds to the informal idea of finding the area under the graph of a function. The first theory of integration was developed by Archimedes...
    18 KB (2,082 words) - 07:05, 6 May 2024
  • Thumbnail for Citation index
    Geography. pp. 507–523. doi:10.1002/9781118725771.ch37. ISBN 978-1-118-72577-1. Tietze, Susanne; Dick, Penny. "The Victorious English Language: Hegemonic Practices...
    30 KB (3,349 words) - 08:56, 10 July 2024
  • Schwerdtfeger, Teubner-Archiv zur Mathematik; vol. 3, 251 p.: 1 Ill., graph. Darst.; 22 cm, Teubner, Leipzig 1985. Über die analytische Fortsetzung...
    11 KB (1,077 words) - 21:10, 28 June 2024
  • Thumbnail for General topology
    polynomial equations. A linear graph has a natural topology that generalises many of the geometric aspects of graphs with vertices and edges. Many sets...
    42 KB (5,724 words) - 02:31, 8 November 2023
  • a geometry, in the sense of geometric group theory: one has the Cayley graph, which has a metric, called the word metric. These are also two resulting...
    22 KB (2,428 words) - 08:01, 8 July 2024
  • numbers can be represented by a graph in the Cartesian plane; such a function is continuous if, roughly speaking, the graph is a single unbroken curve whose...
    60 KB (9,404 words) - 15:58, 13 April 2024
  • Thumbnail for Binary-coded decimal
    This extremal is reached with the ten [heavily-marked vertices of the graph of Fig. 4 for n = 4, or, in fact, with any set of ten code combinations...
    114 KB (8,403 words) - 05:52, 21 July 2024
  • Thumbnail for Algebraic geometry
    geometric modelling. There are also connections to string theory, game theory, graph matchings, solitons and integer programming. Glossary of classical algebraic...
    61 KB (7,500 words) - 04:16, 19 July 2024
  • randomly chosen Nielsen transformations in order to take a random walk on the graph of generating sets of the group. The algorithm is well studied, and survey...
    16 KB (1,924 words) - 03:52, 22 July 2024
  • Thumbnail for Binary logarithm
    equality when the partial cube is a hypercube graph. According to Ramsey's theorem, every n-vertex undirected graph has either a clique or an independent set...
    40 KB (4,788 words) - 13:05, 29 December 2023
  • without any sudden changes in resistance while inhaling or exhaling. In the graph, right, note the initial spike in pressure on exhaling to open the exhaust...
    42 KB (4,873 words) - 17:50, 20 July 2024