Szekeres snark
From Wikipedia, the free encyclopedia
| Szekeres snark | |
|---|---|
 The Szekeres snark |
|
| Named after | George Szekeres |
| Vertices | 50 |
| Edges | 75 |
| Chromatic number | 3 |
| Chromatic index | 4 |
| Properties | Snark Hypohamiltonian |
In the mathematical field of graph theory, the Szekeres snark is a snark with 50 vertices and 75 edges[1]. It was the fifth known snark, discovered by George Szekeres in 1973.[2]
As a snark, the Szekeres graph is a connected, bridgeless cubic graph with chromatic index equal to 4. The Szekeres snark is non-planar and non-hamiltonian but is hypohamiltonian.[3]
Another well known snark on 50 vertices is the Watkins snark discovered by John J. Watkins in 1989.[4]
[edit] Gallery
-
The chromatic number of the Szekeres snark is 3.
-
The chromatic index of the Szekeres snark is 4.
-
Alternative drawing of the Szekeres snark.
[edit] References
- ^ Weisstein, Eric W., "Szekeres Snark" from MathWorld.
- ^ Szekeres, G. (1973). "Polyhedral decompositions of cubic graphs". Bull. Austral. Math. Soc. 8 (3): 367–387. doi:10.1017/S0004972700042660.
- ^ Weisstein, Eric W., "Hypohamiltonian Graph" from MathWorld.
- ^ Watkins, J. J. "Snarks." Ann. New York Acad. Sci. 576, 606-622, 1989.
.svg){kind=small} |
This combinatorics-related article is a stub. You can help Wikipedia by expanding it. |
