Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Knight's_graph> ?p ?o. }
Showing items 1 to 32 of
32
with 100 items per page.
- Knight's_graph abstract "In graph theory, a knight's graph, or a knight's tour graph, is a graph that represents all legal moves of the knight chess piece on a chessboard where each vertex represents a square on a chessboard and each edge is a legal move.More specifically, an knight's tour graph is a knight's tour graph of an chessboard.For a knight's tour graph the total number of vertices is simply . For a knight's tour graph the total number of vertices is simply and the total number of edges is .A Hamiltonian path on the knight's tour graph is a knight's tour. Schwenk's theorem characterizes the sizes of chessboard for which a knight's tour exist.".
- Knight's_graph thumbnail Knight's_graph.svg?width=300.
- Knight's_graph wikiPageID "4508811".
- Knight's_graph wikiPageRevisionID "572711844".
- Knight's_graph edges "4".
- Knight's_graph girth "4".
- Knight's_graph hasPhotoCollection Knight's_graph.
- Knight's_graph imageCaption "8".
- Knight's_graph name "Knight's graph".
- Knight's_graph vertices "nm".
- Knight's_graph subject Category:Mathematical_chess_problems.
- Knight's_graph subject Category:Parametric_families_of_graphs.
- Knight's_graph type Abstraction100002137.
- Knight's_graph type Attribute100024264.
- Knight's_graph type Communication100033020.
- Knight's_graph type Condition113920835.
- Knight's_graph type Difficulty114408086.
- Knight's_graph type Graph107000195.
- Knight's_graph type MathematicalChessProblems.
- Knight's_graph type Problem114410605.
- Knight's_graph type State100024720.
- Knight's_graph type VisualCommunication106873252.
- Knight's_graph comment "In graph theory, a knight's graph, or a knight's tour graph, is a graph that represents all legal moves of the knight chess piece on a chessboard where each vertex represents a square on a chessboard and each edge is a legal move.More specifically, an knight's tour graph is a knight's tour graph of an chessboard.For a knight's tour graph the total number of vertices is simply .".
- Knight's_graph label "Knight's graph".
- Knight's_graph label "Граф ходов коня".
- Knight's_graph sameAs m.0c6577.
- Knight's_graph sameAs Q6422173.
- Knight's_graph sameAs Q6422173.
- Knight's_graph sameAs Knight's_graph.
- Knight's_graph wasDerivedFrom Knight's_graph?oldid=572711844.
- Knight's_graph depiction Knight's_graph.svg.
- Knight's_graph isPrimaryTopicOf Knight's_graph.
