𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A numerical approach to long cycles in graphs and digraphs

✍ Scribed by Miroslav Fiedler


Book ID
108315551
Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
54 KB
Volume
235
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.


πŸ“œ 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

Long paths and cycles in tough graphs
✍ H. J. Broersma; J. van den Heuvel; H. A. Jung; H. J. Veldman πŸ“‚ Article πŸ“… 1993 πŸ› Springer Japan 🌐 English βš– 575 KB
Disjoint Cycles in Eulerian Digraphs and
✍ Richard A. Brualdi; Jian Shen πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 87 KB

denote the set of all m Γ— n {0, 1}-matrices with row sum vector R and column sum vector S. Suppose A(R, S) ] ". The interchange graph G(R, S) of A(R, S) was defined by Brualdi in 1980. It is the graph with all matrices in A(R, S) as its vertices and two matrices are adjacent provided they differ by

ChvΓ‘tal-Erdős conditions for pat
✍ 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.