On finding the elementary paths and circuits of a digraph

Authors

  • Dănuţ Marcu Bucharest, Romania
Abstract views: 115

Abstract

Not available.

Downloads

Download data is not yet available.

References

Berge, C., Graphes et hypergraphes, Dunod, Paris, 1970.

Danielson, G. H., On finding the simple paths and circuits in a graph, IEEE Trans., CT-15, 1968.

Dhawan, V., Hamiltonian circuits and related problems in graph theory, M. Sc. Report, Imperial College, London, 1969.

Kaufmann A., et D. Coster, Exercices de combinatorique avec solutions (tome II), Dunod, Paris, 1970.

Yau, S. S., generation of all Hamiltonian circuits, paths and centers of a graph and related problems. IEEE Trans., CT-14, 1967.

Downloads

Published

1991-08-01

How to Cite

Marcu, D. (1991). On finding the elementary paths and circuits of a digraph. Anal. Numér. Théor. Approx., 20(1), 59–63. Retrieved from https://ictp.acad.ro/jnaat/journal/article/view/1991-vol20-nos1-2-art8

Issue

Vol 20, Nos 1-2 (1991)

Section

Articles

License

Copyright (c) 2015 Journal of Numerical Analysis and Approximation Theory

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Open Access. This article is distributed under the terms of the Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.