knight's graph
0 sources
knight's graph
Summary
knight's graph is a mathematical chess problem[1]. It draws 48 Wikipedia views per month (mathematical_chess_problem category, ranking #5 of 6).[2]
Key Facts
- knight's graph's image is recorded as Knight's graph.svg[3].
- knight's graph's instance of is recorded as mathematical chess problem[4].
- knight is named after knight's graph[5].
- knight's graph's subclass of is recorded as unit distance graph[6].
- knight's graph's subclass of is recorded as bipartite graph[7].
- knight's graph's has use is recorded as knight's tour[8].
- knight's graph's sport is recorded as chess[9].
- knight's graph's Freebase ID is recorded as /m/0c6577[10].
- knight's graph's different from is recorded as rook's graph[11].
- knight's graph's different from is recorded as king's graph[12].
- knight's graph's different from is recorded as queen's graph[13].
- knight's graph's different from is recorded as bishop's graph[14].
- knight's graph's studied by is recorded as graph theory[15].
- knight's graph's MathWorld ID is recorded as KnightGraph[16].
- knight's graph's Wolfram Language entity code is recorded as Entity["GraphClass", "Knight"][17].
- knight's graph's maintained by WikiProject is recorded as WikiProject Mathematics[18].
- knight's graph's maintained by WikiProject is recorded as WikiProject Chess[19].
- knight's graph's Microsoft Academic ID is recorded as 2776085366[20].
Why It Matters
knight's graph draws 48 Wikipedia views per month (mathematical_chess_problem category, ranking #5 of 6).[2] It has Wikipedia articles in 5 language editions, a strong signal of global cultural recognition.[21]