Abstract—A decomposition of a graph G is a collection ψ of subgraphs H1,H2,..., Hr of G such that every edge of G belongs to exactly one Hi. If each Hi is either an induced path or an induced cycle in G, thenψ is called an induced path decomposition of G. The minimum cardinality of an induced path decomposition of G is called the induced path decomposition number of G and is denoted by πi(G). In this paper we initiate a study of this parameter. Keywords—Path decomposition, Induced path decomposition, Induced path decomposition number. I
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.