๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Matchings and cycle covers in random digraphs

โœ Scribed by John Gimbel; E.M. Palmer

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
407 KB
Volume
34
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On large matchings and cycles in sparse
On large matchings and cycles in sparse random graphs
โœ A.M Frieze ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 666 KB

Let k be a fixed positive integer. A graph H has property Mk if it contains [ยฝk] edge disjoint hamilton cycles plus a further edge disjoint matching which leaves at most one vertex isolated, if k is odd. Let p = c/n, where c is a large enough constant. We show that G,,p a.s. contains a vertex induce

Cycle packings in graphs and digraphs
Cycle packings in graphs and digraphs
โœ Jennifer J. Quinn ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 196 KB

A cycle packing in a (directed) multigraph is a vertex disjoint collection of (directed) elementary cycles. If D is a demiregular multidigraph we show that the arcs of D can be partitioned into Ai. cycle packings --where Ain is the maximum indegree of a vertex in D. We then show that the maximum len

Cycle extendability in graphs and digrap
Cycle extendability in graphs and digraphs
โœ LeRoy B. Beasley; David E. Brown ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 201 KB

In 1990, Hendry conjectured that all chordal Hamiltonian graphs are cycle extendable, that is, the vertices of each non-Hamiltonian cycle are contained in a cycle of length one greater. Let A be a symmetric (0,1)-matrix with zero main diagonal such that A is the adjacency matrix of a chordal Hamilto

On cycles and paths in digraphs
On cycles and paths in digraphs
โœ M.C. Heydemann ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 273 KB

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].