Skip to main content
Article thumbnail
Location of Repository

Decomposition of graphs into induced paths and cycles

By I. Sahul Hamid and Abraham V. M


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

Year: 2013
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.