A camel graph is a graph formed by all possible moves of a hypothetical chess piece called a "camel" which moves analogously to
a knight except that it is restricted to moves that change by one square along one
axis of the board and three squares along the other. To form the graph,
each chessboard square is considered a vertex,
and vertices connected by allowable camel moves are
considered edges. It is therefore a 
-leaper graph, as well
as the 
-Euclidean distance graph.
The term "camel graph" dates back to at least T. R. Dawson, who used it in his "Caissa's Playthings" column in Cheltenham Examiner in 1913 (Jelliss 2019).
Ball and Coxeter (1987, p. 186) state, "Euler's method [to construct a Hamiltonian cycle] can be applied to find routes of this kind: for instance, he applied it to find a re-entrant route by which a piece that moved two cells forward like a castle [rook] and then one cell like a bishop would occupy in succession all the black cells on the board." Such a series of moves corresponds to a camel tour (Jelliss 2019).
Like bishop graphs, camel graphs are disconnected (except for the trivial singleton graph on a 
board which is trivially connected),
with each component being restricted to either
black or white squares. Again, as with the bishop graph,
the black and white components of an 
camel graph are isomorphic iff 
and 
are not both odd.
The 
camel graph consists of a connected white component
and a disconnected black component which, as
in the case of the 
knight graph, includes a central (unreachable from all
of the other squares) isolated vertex.
Camel graphs are bicolorable, bipartite, class 1, perfect, triangle-free, and weakly perfect.
Precomputed properties of camel graphs are implemented in the Wolfram Language as GraphData[
"Camel", 
m, n
].
1, 3
Shaped
Boards." §10.27 in Knight's Tour Notes. 2019.