✦ LIBER ✦

Exact arborescences, matchings and cycles

✍ Scribed by Francisco Barahona; William R Pulleyblank

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 531 KB
Volume: 16
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(87)90067-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimal complete matchings and negative

Minimal complete matchings and negative cycles

✍ R. L. Tobin 📂 Article 📅 1975 🏛 John Wiley and Sons 🌐 English ⚖ 627 KB

## Abstract Conditions are developed which relate the existence of negative and nonpositive simple cycles in an undirected network to minimal complete matchings on a derived network. These conditions are then used to develop a test to determine whether or not an undirected network contains nonposit

Cycles containing matchings and pairwise

Cycles containing matchings and pairwise compatible euler tours

✍ Bill Jackson; Nicholas C. Wormald 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 535 KB

## Abstract Let __M__ be a matching in a graph __G__ such that __d__(x) + __d__(y) ≥ |__G__| for all pairs of independent vertices x and y of G that are incident with __M.__ We determine a necessary and sufficient condition for __M__ to be contained in a cycle of __G.__ This extends results of Hägg

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

Random Matchings Which Induce Hamilton C

Random Matchings Which Induce Hamilton Cycles and Hamiltonian Decompositions of Random Regular Graphs

✍ Jeong Han Kim; Nicholas C. Wormald 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 215 KB

Select four perfect matchings of 2n vertices, independently at random. We find the asymptotic probability that each of the first and second matchings forms a Hamilton cycle with each of the third and fourth. This is generalised to embrace any fixed number of perfect matchings, where a prescribed set

Matchings and cycle covers in random dig

Matchings and cycle covers in random digraphs

✍ John Gimbel; E.M. Palmer 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 407 KB

A general and exact method for determini

A general and exact method for determining limit cycles in decentralized relay systems

✍ Z.J. Palmor; Y. Halevi; T. Efrati 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 769 KB

exact method for evaluating the periods and stability of limit cycles in decentralized relay systems is presented. The method can cope with relays having dead zones and hystereses. The underlying idea is to convert the continuous decentralized relay system under a limit cycle to an equivalent fictit