The induced path number of a complete multipartite graph

In: Tatra Mountains Mathematical Publications, vol. 9, no. 3

Izak Broere - Elizabeth Jonck - Margit Voigt

Detaily:

Rok, strany: 1996, 83 - 88

O článku:

The induced path number $ρ(G)$ of a graph $G$ is defined as the minimum number of subsets into which the vertex set of $G$ can be partitioned so that each subset induces a path. In this paper we determine the induced path number of a complete $l$-partite graph.

Ako citovať:

ISO 690:

Broere, I., Jonck, E., Voigt, M. 1996. The induced path number of a complete multipartite graph. In Tatra Mountains Mathematical Publications, vol. 9, no.3, pp. 83-88. 1210-3195.

APA:

Broere, I., Jonck, E., Voigt, M. (1996). The induced path number of a complete multipartite graph. Tatra Mountains Mathematical Publications, 9(3), 83-88. 1210-3195.