✦ LIBER ✦

On cycles and paths in digraphs

✍ Scribed by M.C. Heydemann

Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 273 KB
Volume: 31
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(80)90039-4

No coin nor oath required. For personal study only.

✦ Synopsis

The purpose of this communication is to announce some slrfficient conditions on degrees and number of arcs to insure the existence of cycles and paths in directed graphs. We show that these results are the best possible. The proofs of the theorems can be found in [4].

📜 SIMILAR VOLUMES

Paths, cycles, and arc-connectivity in d

Paths, cycles, and arc-connectivity in digraphs

✍ Xiang-Ying Su 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 645 KB

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

Vertex heaviest paths and cycles in quas

Vertex heaviest paths and cycles in quasi-transitive digraphs

✍ Jørgen Bang-Jensen; Gregory Gutin 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 381 KB

A digraph D is called a quasi-transitive digraph (QTD) if for any triple x,y,z of distinct vertices of D such that (x,y) and (y,z) are arcs of D there is at least one at': from x to z or from z to x. Solving a conjecture by Bangdensen and Huang (1995), Gutin (1995) described polynomial algorithms fo

Digraphs with maximum number of paths an

Digraphs with maximum number of paths and cycles

✍ Yehoshua Perl 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 482 KB

Hamiltonian cycles and paths in Cayley g

Hamiltonian cycles and paths in Cayley graphs and digraphs — A survey

✍ 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

Packing paths in digraphs

✍ Richard C. Brewster; Pavol Hell; Sarah H. Pantel; Romeo Rizzi; Anders Yeo 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 132 KB

## Abstract Let ${\cal G}$ be a fixed set of digraphs. Given a digraph __H__, a ${\cal G}$‐packing in __H__ is a collection ${\cal P}$ of vertex disjoint subgraphs of __H__, each isomorphic to a member of ${\cal G}$. A ${\cal G}$‐packing ${\cal P}$ is __maximum__ if the number of vertices belonging