An algorithm to cyclic path covering number. (English) Zbl 1267.05272
Balakrishnan, R. (ed.) et al., International conference on graph theory and its applications. Papers from the conference, Coimbatore, India, December 11–13, 2008. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 33, 21-28 (2009).
Summary: In this paper we develop an algorithm to find the cyclic path covering number of any graph, by finding the cyclic path covering number of a tree graph.
For the entire collection see [Zbl 1239.05003].
For the entire collection see [Zbl 1239.05003].
MSC:
| 05C85 | Graph algorithms (graph-theoretic aspects) |
| 05C38 | Paths and cycles |
| 05C45 | Eulerian and Hamiltonian graphs |
| 05C70 | Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) |
References:
| [1] | Harary, F., Covering and packing in graphs I, Ann. N.Y. Acad. Sci., 175, 198-205 (1970) · Zbl 0226.05119 |
| [2] | Harary, F.; Schwenk, A. J., Evolution of the path number of a graph, covering and packing in graphs II, (Road, R. C., Graph Theory and Computing (1972), Academic Press: Academic Press New York), 39-45 · Zbl 0256.05115 |
| [3] | Peroche, B., The path number of some multipartite graphs, Annals of Discrete Math., 9, 193-197 (1982) |
| [4] | Stanton, R. G.; Cowan, D. D.; James, L. O., Some result on path numbers, (Proc. Louisiana Conf. on Combinatories, Graph theory and computing (1970)), 112-135 · Zbl 0223.05120 |
| [5] | Stanton, R. G.; Cowan, D. D.; James, L. O., Tripartite path number, (Road, R. C., Graph Theory and Computing (1973), Academic Press: Academic Press New York), 285-294 · Zbl 0245.05117 |
| [6] | Harary, Graph Theory (1972), Addison Wesley · Zbl 0235.05105 |
| [7] | Clark, John; Holton, Derek Allan, A First look at Graph Theory (1991) · Zbl 0765.05001 |
| [8] | Solairaju, A.; Rajasekar, G., Cyclic Path Covering Number, (Proc. International conf. on Mathematics and Computer Science (2008)), 223-231 · Zbl 1267.05272 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
