𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey

✍ Scribed by Bill Jackson; Oscar Ordaz


Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
783 KB
Volume
84
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis


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.


📜 SIMILAR VOLUMES


Hamiltonian cycles and paths in Cayley g
✍ Stephen J. Curran; Joseph A. Gallian 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 927 KB

Cayley graphs arise naturally in computer science, in the study of word-hyperbolic groups and automatic groups, in change-ringing, in creating Escher-like repeating patterns in the hyperbolic plane, and in combinatorial designs. Moreover, Babai has shown that all graphs can be realized as an induced