✦ LIBER ✦

Tools for studying paths and cycles in digraphs

✍ Scribed by Delorme, C.; Ordaz, O.; Quiroz, D.

Publisher: John Wiley and Sons
Year: 1998
Tongue: English
Weight: 251 KB
Volume: 31
Category: Article
ISSN: 0028-3045
DOI: 10.1002/(sici)1097-0037(199803)31:2<125::aid-net7>3.0.co;2-j

No coin nor oath required. For personal study only.

✦ Synopsis

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 used as a ''kernel'' of the AGORA interactive system, for assisting a graph researcher in the mental process of constructing and studying conjectures in the mentioned specialized field.

📜 SIMILAR VOLUMES

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

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

Oriented hamilton cycles in digraphs

✍ Roland Häggkvist; Andrew Thomason 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 473 KB

## Abstract We show that a directed graph of order __n__ will contain __n__‐cycles of every orientation, provided each vertex has indegree and outdegree at least (1/2 + __n__^‐1/6^)__n__ and __n__ is sufficiently large. © 1995 John Wiley & Sons, Inc.

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

A Matrix for Counting Paths in Acyclic D

A Matrix for Counting Paths in Acyclic Digraphs

✍ Richard P. Stanley 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 178 KB

We define a matrix A associated with an acyclic digraph 1, such that the coefficient of z j in det(I+zA) is the number of j-vertex paths in 1. This result is actually a special case of a more general weighted version.

Hamiltonian paths and cycles in hypertou

Hamiltonian paths and cycles in hypertournaments

✍ Gutin, Gregory; Yeo, Anders 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 138 KB

Given two integers n and k, n ≥ k > 1, a k-hypertournament T on n vertices is a pair (V, A), where V is a set of vertices, |V | = n and A is a set of k-tuples of vertices, called arcs, so that for any k-subset S of V, A contains exactly one of the k! k-tuples whose entries belong to S. A 2-hypertour