| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652412 | Electronic Notes in Discrete Mathematics | 2009 | 8 Pages |
Abstract
In this paper we develop an algorithm to find Cyclic Path covering number of any graph, by finding the Cyclic Path covering number of a tree graph.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
