The Problem of the Black Traveler and Bank Clerk is defined on a graph, directed or not, in which the vertices that represent the cities are classified as black or white.
The cardinality constraint is related to the maximum number (Q) of white vertices between two blacks.
The length restriction defines the maximum distance (L) that can exist between two black vertices.