The 
-triangular honeycomb obtuse knight graph, called a hex knight
graph and denoted 
by Wagon (2014), thus conflicting with the same notation
used for the triangular honeycomb
acute knight graph by DeMaio and Tran (2103), is a graph consisting of vertices
on a triangular honeycomb board with
vertices along each side, where vertices are connected by an edge if they are reachable
by two steps in the same direction and one in a direction that is "farther"
from the initial vertex, thus making an obtuse angle
when the knight turns. The graphs for 
and 5 are illustrated above.
Special cases are summarized in the following table.
 | isomorphic graph |
| 1 | singleton graph  |
| 2 | empty
graph  |
| 3 | empty graph  |
| 4 |  |
Triangular honeycomb obtuse knight graphs are class-1, nongeometric, simple, unit-distance, and weakly perfect.
Triangular honeycomb obtuse knight graphs are implemented in the Wolfram Language as GraphData[
"TriangularHoneycombObtuseKnight",
n
].
