king's graph
0 sources
king's graph
Summary
king's graph is a mathematical chess problem[1]. It draws 47 Wikipedia views per month (mathematical_chess_problem category, ranking #6 of 6).[2]
Key Facts
- king's graph's image is recorded as King's graph.svg[3].
- king's graph's instance of is recorded as mathematical chess problem[4].
- king is named after king's graph[5].
- king's graph's subclass of is recorded as undirected graph[6].
- king's graph's subclass of is recorded as cop-win graph[7].
- king's graph's Freebase ID is recorded as /m/0c656k[8].
- king's graph's different from is recorded as rook's graph[9].
- king's graph's different from is recorded as knight's graph[10].
- king's graph's different from is recorded as lattice graph[11].
- king's graph's different from is recorded as queen's graph[12].
- king's graph's different from is recorded as bishop's graph[13].
- king's graph's different from is recorded as Moore neighborhood[14].
- king's graph's studied by is recorded as graph theory[15].
- king's graph's MathWorld ID is recorded as KingGraph[16].
- king's graph's Wolfram Language entity code is recorded as Entity["GraphClass", "King"][17].
- king's graph's maintained by WikiProject is recorded as WikiProject Mathematics[18].
- king's graph's Microsoft Academic ID is recorded as 2775903103[19].
Why It Matters
king's graph draws 47 Wikipedia views per month (mathematical_chess_problem category, ranking #6 of 6).[2] It has Wikipedia articles in 5 language editions, a strong signal of global cultural recognition.[20] It is known by 3 alternative names across languages and contexts.[21]