𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Universal traversal sequences for paths and cycles

✍ Scribed by Michael F Bridgland

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
552 KB
Volume
8
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Tools for studying paths and cycles in d
Tools for studying paths and cycles in digraphs
✍ Delorme, C.; Ordaz, O.; Quiroz, D. πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 251 KB

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

Parity theorems for paths and cycles in
Parity theorems for paths and cycles in graphs
✍ J. A. Bondy; F. Y. Halberstam πŸ“‚ Article πŸ“… 1986 πŸ› John Wiley and Sons 🌐 English βš– 294 KB πŸ‘ 1 views

We extend an elegant proof technique of A . G . Thomason, and deduce several parity theorems for paths and cycles in graphs. For example, a graph in which each vertex is of even degree has an even number of paths if and only if it is of even order, and a graph in which each vertex is of odd degree h

ChvΓ‘tal-Erdős conditions for pat
ChvΓ‘tal-Erdős conditions for paths and cycles in graphs and digraphs. A survey
✍ Bill Jackson; Oscar Ordaz πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 783 KB

We give a survey of results and conjectures concerning sufficient conditions in terms of connectivity and independence number for which a graph or digraph has various path or cyclic properties, for example hamilton path/cycle, hamilton connected, pancyclic, path/cycle covers, 2-cyclic.