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

regular graphs are vertex-transitive (for example, the Frucht graph and Tietze's graph). Finite vertex-transitive graphs include the symmetric graphs (such...

developed the Tietze transformations for group presentations, and was the first to pose the group isomorphism problem. Tietze's graph is also named after...

theorem Tietze's graph Tietze transformation in mathematics, named after Heinrich Tietze Tietze syndrome in medicine, named after Alexander Tietze This disambiguation...

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

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

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

Franklin graph Frucht graph Goldner–Harary graph Golomb graph Grötzsch graph Harries graph Harries–Wong graph Herschel graph Hoffman graph Holt graph Horton...

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

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