𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Competition Graphs of Strongly Connected and Hamiltonian Digraphs

✍ Scribed by Fraughnaugh, Kathryn F.; Lundgren, J. Richard; Merz, Sarah K.; Maybee, John S.; Pullman, Norman J.

Book ID
118198105
Publisher
Society for Industrial and Applied Mathematics
Year
1995
Tongue
English
Weight
1019 KB
Volume
8
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Competition Graphs of Hamiltonian Digrap
Competition Graphs of Hamiltonian Digraphs
✍ Guichard, David R. πŸ“‚ Article πŸ“… 1998 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 203 KB
Strongly Hamiltonian-connected locally s
Strongly Hamiltonian-connected locally semicomplete digraphs
✍ Guo, Yubao πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 513 KB

We give some sufficient conditions for locally semicomplete digraphs to contain a hamiltonian path from a prescribed vertex to another prescribed vertex. As an immediate consequence of these, we obtain that every 4-connected locally semicomplete digraph is strongly hamiltonian-connected. Our results

Weakly Hamiltonian-connected locally sem
Weakly Hamiltonian-connected locally semicomplete digraphs
✍ Bang-Jensen, JοΏ½rgen; Guo, Yubao; Volkmann, Lutz πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 630 KB

We characterize weakly hamiltonian-connected locally semicomplete digraphs.

Every finite strongly connected digraph
Every finite strongly connected digraph of stability 2 has a Hamiltonian path
✍ C.C. Chen; P. Manalastas Jr. πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science 🌐 English βš– 333 KB

Two circuits C~ and C 2 in a digraph are called consistent circuits if and only if their intersection is either empty, a singleton or a subpath of both C~ and C 2. It is proved that Every finite strongly connected digraph of G of stability at most 2 is spanned by two consistent circuits. As a conseq