Tietze's graph

Tietze's graph
	The Tietze graph
Vertices	12
Edges	18
Radius	3
Diameter	3
Girth	3
Automorphisms	12 (D6)
Chromatic number	3
Chromatic index	4
Properties	Cubic; Snark
	Table of graphs and parameters

In the mathematical 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 in 1910 that the Möbius strip can be subdivided into six regions that all touch each other – three along the boundary of the strip and three along its center line – and therefore that graphs that are embedded onto the Möbius strip may require six colors.[1] The boundary segments of the regions of Tietze's subdivision (including the segments along the boundary of the Möbius strip itself) form an embedding of Tietze's graph.

Tietze's subdivision of a Möbius strip into six mutually-adjacent regions. The vertices and edges of the subdivision form an embedding of Tietze's graph onto the strip.

Relation to Petersen graph

Tietze's graph may be formed from the Petersen graph by replacing one of its vertices with a triangle.[2][3] Like the Tietze graph, the Petersen graph forms the boundary of six mutually touching regions, but on the projective plane rather than on the Möbius strip. If one cuts a hole from this subdivision of the projective plane, surrounding a single vertex, the surrounded vertex is replaced by a triangle of region boundaries around the hole, giving the previously described construction of the Tietze graph.

Hamiltonicity

Both Tietze's graph and the Petersen graph are maximally nonhamiltonian: they have no Hamiltonian cycle, but any two non-adjacent vertices can be connected by a Hamiltonian path.[2] Tietze's graph and the Petersen graph are the only 2-vertex-connected cubic non-Hamiltonian graphs with 12 or fewer vertices.[4]

Unlike the Petersen graph, Tietze's graph is not hypohamiltonian: removing one of its three triangle vertices forms a smaller graph that remains non-Hamiltonian.

Edge coloring and perfect matchings

Edge coloring Tietze's graph requires four colors; that is, its chromatic index is 4. Equivalently, the edges of Tietze's graph can be partitioned into four matchings, but no fewer.

Tietze's graph matches part of the definition of a snark: it is a cubic bridgeless graph that is not 3-edge-colorable. However, some authors restrict snarks to graphs without 3-cycles and 4-cycles, and under this more restrictive definition Tietze's graph is not a snark. Tietze's graph is isomorphic to the graph J₃, part of an infinite family of flower snarks introduced by R. Isaacs in 1975.[5]

Unlike the Petersen graph, the Tietze graph can be covered by four perfect matchings. This property plays a key role in a proof that testing whether a graph can be covered by four perfect matchings is NP-complete.[6]

Additional properties

Tietze's graph has chromatic number 3, chromatic index 4, girth 3 and diameter 3. The independence number is 5. Its automorphism group has order 12, and is isomorphic to the dihedral group D₆, the group of symmetries of a hexagon, including both rotations and reflections. This group has two orbits of size 3 and one of size 6 on vertices, and thus this graph is not vertex-transitive.

Gallery

The chromatic number of the Tietze graph is 3.
The chromatic index of the Tietze graph is 4.
The Tietze graph has crossing number 2 and is 1-planar.
A three-dimensional embedding of the Tietze graph.

gollark: Poe's law applies to reality, evidently.

gollark: PRs welcome!

gollark: It tries between 1 and 4 bytes and sees if any work.

gollark: It's not a length terminated int, just 1 to 4 bytes some endianness.

gollark: I have a C implementation.

Notes

Tietze, Heinrich (1910), "Einige Bemerkungen zum Problem des Kartenfärbens auf einseitigen Flächen" [Some remarks on the problem of map coloring on one-sided surfaces], DMV Annual Report, 19: 155–159.
Clark, L.; Entringer, R. (1983), "Smallest maximally nonhamiltonian graphs", Periodica Mathematica Hungarica, 14 (1): 57–68, doi:10.1007/BF02023582
Weisstein, Eric W. "Tietze's Graph". MathWorld.
Punnim, Narong; Saenpholphat, Varaporn; Thaithae, Sermsri (2007), "Almost Hamiltonian cubic graphs" (PDF), International Journal of Computer Science and Network Security, 7 (1): 83–86
Isaacs, R. (1975), "Infinite families of nontrivial trivalent graphs which are not Tait colorable", Amer. Math. Monthly, Mathematical Association of America, 82 (3): 221–239, doi:10.2307/2319844, JSTOR 2319844.
Esperet, L.; Mazzuoccolo, G. (2014), "On cubic bridgeless graphs whose edge-set cannot be covered by four perfect matchings", Journal of Graph Theory, 77 (2): 144–157, arXiv:1301.6926, doi:10.1002/jgt.21778, MR 3246172.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.

[1] Tietze, Heinrich (1910), "Einige Bemerkungen zum Problem des Kartenfärbens auf einseitigen Flächen" [Some remarks on the problem of map coloring on one-sided surfaces], DMV Annual Report, 19: 155–159.

[CE-2] Clark, L.; Entringer, R. (1983), "Smallest maximally nonhamiltonian graphs", Periodica Mathematica Hungarica, 14 (1): 57–68, doi:10.1007/BF02023582

[3] Weisstein, Eric W. "Tietze's Graph". MathWorld.

[4] Punnim, Narong; Saenpholphat, Varaporn; Thaithae, Sermsri (2007), "Almost Hamiltonian cubic graphs" (PDF), International Journal of Computer Science and Network Security, 7 (1): 83–86

[5] Isaacs, R. (1975), "Infinite families of nontrivial trivalent graphs which are not Tait colorable", Amer. Math. Monthly, Mathematical Association of America, 82 (3): 221–239, doi:10.2307/2319844, JSTOR 2319844.

[6] Esperet, L.; Mazzuoccolo, G. (2014), "On cubic bridgeless graphs whose edge-set cannot be covered by four perfect matchings", Journal of Graph Theory, 77 (2): 144–157, arXiv:1301.6926, doi:10.1002/jgt.21778, MR 3246172.