Decompositions of digraphs into paths and cycles
โ Scribed by Malaz Maamoun
- Publisher
- Elsevier Science
- Year
- 1985
- Tongue
- English
- Weight
- 226 KB
- Volume
- 38
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The purpose of this communication is to announce some slrfficient conditions on degrees and number of arcs to insure the existence of cycles and paths in directed graphs. We show that these results are the best possible. The proofs of the theorems can be found in [4].
The main goal of this work was to describe the basic elements constituting a specialized knowledge base in the field of paths and circuits in digraphs. This knowledge base contains commented on examples with textual and graphical descriptions, invariants, relations among invariants, and theorems. It