The 
-triangular honeycomb acute knight graph 
(DeMaio and Tran 2013) 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 "closer"
to the initial vertex, thus making an acute 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 | ladder rung graph  |
| 4 | two
triangles  and a claw  |
| 5 | three darts |
Triangular honeycomb acute knight graphs are apex, class 1, linklessly embeddable, map, matchstick, nongeometric, planar, projective planar, unit-distance, and weakly perfect.
Triangular honeycomb acute knight graphs are implemented in the Wolfram Language as GraphData[
"TriangularHoneycombAcuteKnight",
n
].
