Blanuša snark
two 3-regular graphs with 18 vertices and 27 edges
Facts
3 properties- Subclass of
- snark, hypohamiltonian graph, traceable graph[2][3][4]
- Named after
- Danilo Blanuša[1]
- Studied by
- graph theory[5]
🏷️ Also known as
en Blanuša snark
fr snark de Blanuša
hu Blanuša-snarkok
ja ブラヌサスナーク
ru cнарк Блануша
ru cнарк Блануши
ru снарки Блануша
ru снарки Блануши
uk снарк Блануші
🔖 Identifiers · 5
- Image (Wikimedia Commons)
- First Blanusa snark.svg ↗
- Freebase ID
- /m/07kc3kd
- MathWorld ID
- BlanusaSnarks
- Microsoft Academic ID (discontinued)
- 2779320133
- Wolfram Language entity code
- Entity["GraphClass", "BlanusaSnarks"]
Press Enter · cited answer in seconds