Broadcasting is an information dissemination primitive where a message is passed from one node (called originator) to all other nodes in the network. In the scope of this paper, we will mainly focus on determining the broadcast time and the optimal broadcasting scheme for graphs. Determination of the broadcast time of a node in an arbitrary network is known to be NP-hard. Polynomial time solutions are known only for a few classes of networks. In this paper, we will consider networks that can be represented as k-path graphs. We will pose a new problem, called 3 list subtraction, and discuss its relation to the broadcast time problem on k-path graphs.