Rare card
Hamiltonian graph
- Value
- 50 W
- Attack
- 273
- Defence
- 218
- Players
- 0
In mathematics, within the framework of graph theory, a Hamiltonian path of a graph oriented or not oriented is a path that passes through all the summits once and a onceMachine translation of the Wikipedia text
Get Hamiltonian graph in your collection
Every Wikilord card is a Wikipedia article. Open packs for free, trade, battle and climb the leaderboard.
Open a free pack