Szekeres snark
graph with 50 vertices and 75 edges
Facts
10 properties- Instance of
- hypohamiltonian graph, snark, k-edge-connected graph, mathematical concept, square-free graph, triangle-free graph, traceable graph[3][4][5][6][7][8]
- Discoverer or inventor
- George Szekeres[2]
- Graph diameter
- 7.0[16]
- Graph girth
- 5.0[17]
- Graph radius
- 6.0[15]
- Maintained by WikiProject
- WikiProject Mathematics[14]
- Named after
- George Szekeres[9]
- Studied by
- graph theory[11]
- Time of discovery or invention
- 1973[10]
🏷️ Also known as
en Szekeres snark
fr snark de Szekeres
ja スゼッケルスナーク
pl Graf Szekeresa
ru снарк Секереша
🔖 Identifiers · 6
- Image (Wikimedia Commons)
- Szekeres snark alt.svg ↗
- Freebase ID
- /m/0cmrkq
- MathWorld ID
- SzekeresSnark
- Microsoft Academic ID (discontinued)
- 2777578229
- The House of Graphs ID
- 1338
- Wolfram Language entity code
- Entity["Graph", "SzekeresSnark"]
🔗 Connections
Instance of 4
Created notable works 1
Discoverer or inventor 1
Maintained by WikiProject 1
Named after 1
Studied by 1
Press Enter · cited answer in seconds
0 sources
Summary
Szekeres snark is a hypohamiltonian graph[1].