Decomposition of Graphs into Paths and Cycles
Work
Year: 2013
Type: article
Abstract: A decomposition of a graph is a collection of edge-disjoint subgraphs of such that every edge of belongs to exactly one . If each is a path or a cycle in , then is called a path decomposition of . If ... more
Source: Journal of Discrete Mathematics
Authors S. Arumugam, I. Sahul Hamid, V. M. Abraham
Cites: 5
Cited by: 22
Related to: 10
FWCI: 1.766
Citation percentile (by year/subfield): 90.45
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold