Szekeres snark
From Wikipedia, the free encyclopedia
Szekeres snark | |
Named after | George Szekeres |
---|---|
Vertices | 50 |
Properties | Snark |
In graph theory, the Szekeres snark is a snark with 50 vertices. It was the fifth known snark, discovered by George Szekeres in 1973.
[edit] References
- Szekeres, G. (1973). "Polyhedral decompositions of cubic graphs". Bull. Austral. Math. Soc. 8: 367–387.