𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On maximal circuits in directed graphs

✍ Scribed by Mordechai Lewin


Book ID
107884035
Publisher
Elsevier Science
Year
1975
Tongue
English
Weight
306 KB
Volume
18
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Maximal circuits of graphs. I
✍ D. R. Woodall πŸ“‚ Article πŸ“… 1976 πŸ› Akadmiai Kiad 🌐 English βš– 222 KB
Hamilton circuits in directed-tree graph
✍ Wai-Kai Chen πŸ“‚ Article πŸ“… 1967 πŸ› Institute of Electrical and Electronics Engineers 🌐 English βš– 450 KB
Paths and circuits in partially directed
✍ D.W. Barnette; Shelley Gillett πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 244 KB

Although questions about Eulerian circuits, paths, and covering edges by edge disjoint paths are easily answered for graphs or directed graphs, they are not easily answered if some edges are directed and others are not. We give necessary and sufficient conditions for an Eulerian path or circuit, and