Add to ORKGThe queens graph can be considered as a system of routes called a transit graph , where two vertices are connected by an edge if and only if there is a path from one vertex to the other in at least one of the routes. The equivalence number is the smallest number of routes needed to form a given transit graph. The study of transit graphs provides a new perspective to the analysis of chessboard graphs with obstacles, and the approach extends to other chess pieces and other types of boards
Two simple graphs, G and H, each of which have n vertices (with n a positive integer greater than 3)...
AbstractA graph may be formed from an n × n chessboard by taking the squares as the vertices and two...
AbstractA saw-toothed chessboard, or STC for short, is a kind of chessboard whose boundary forms two...
The queens graph can be considered as a system of routes called a transit graph , where two vertice...
Represent each square on a chessboard of arbitrary size by a point ( vertex ) and then, for every pa...
In this paper, the necessary conditions for a bipartite graph to be Hamiltonian are first discussed....
This study will try to determine which chessboards can hold a knight\u27s tour. A knight\u27s tour i...
This master thesis discusses various mathematical problems related to the placement of chess pieces....
AbstractA graph G is a queens graph if the vertices of G can be mapped to queens on the chessboard s...
The rook graph $G$ is a graph whose edges represent all the possible legal moves of the rook chess p...
The influence of a vertex set S⊆V(G) is I(S)=∑v∈S(1+deg(v))=∑v∈S|N[v]|, which is the total amount of...
International audienceThe queen graph coloring problem consists in covering a n x n chess board with...
A legal placement of Queens is any placement of Queens on an order N chessboard in which any two att...
A survey of the six domination chain parameters for both square and rectangular chess boards are dis...
We describe a computation that determined the number of knight's tours of a standard chessboard. We ...
Two simple graphs, G and H, each of which have n vertices (with n a positive integer greater than 3)...
AbstractA graph may be formed from an n × n chessboard by taking the squares as the vertices and two...
AbstractA saw-toothed chessboard, or STC for short, is a kind of chessboard whose boundary forms two...
The queens graph can be considered as a system of routes called a transit graph , where two vertice...
Represent each square on a chessboard of arbitrary size by a point ( vertex ) and then, for every pa...
In this paper, the necessary conditions for a bipartite graph to be Hamiltonian are first discussed....
This study will try to determine which chessboards can hold a knight\u27s tour. A knight\u27s tour i...
This master thesis discusses various mathematical problems related to the placement of chess pieces....
AbstractA graph G is a queens graph if the vertices of G can be mapped to queens on the chessboard s...
The rook graph $G$ is a graph whose edges represent all the possible legal moves of the rook chess p...
The influence of a vertex set S⊆V(G) is I(S)=∑v∈S(1+deg(v))=∑v∈S|N[v]|, which is the total amount of...
International audienceThe queen graph coloring problem consists in covering a n x n chess board with...
A legal placement of Queens is any placement of Queens on an order N chessboard in which any two att...
A survey of the six domination chain parameters for both square and rectangular chess boards are dis...
We describe a computation that determined the number of knight's tours of a standard chessboard. We ...
Two simple graphs, G and H, each of which have n vertices (with n a positive integer greater than 3)...
AbstractA graph may be formed from an n × n chessboard by taking the squares as the vertices and two...
AbstractA saw-toothed chessboard, or STC for short, is a kind of chessboard whose boundary forms two...