Let H = W F be a graph without multiple edges, but with the possibility of having loops. Let G = V E be a simple graph. A homomorphism c is a map c V β W with the property that v w β E implies that c v c w β F. We will often refer to c v as the color of v and c as an H-coloring of G. We consider the
Randomly matchable graphs
β Scribed by David P. Summer
- Publisher
- John Wiley and Sons
- Year
- 1979
- Tongue
- English
- Weight
- 190 KB
- Volume
- 3
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
A graph is defined to be randomly matchable if every matching of G can be extended to a perfect matching. It is shown that the connected randomly matchable graphs are precisely K~2__n__~ and K~n,n~ (n β₯ 1).
π SIMILAR VOLUMES
## Abstract An __antipath__ in a digraph is a semipath containing no (directed) path of length 2. A digraph __D__ is __randomly antitraceable__ if for each vertex __v__ of __D__, any antipath beginning at __v__ can be extended to a hamiltonian antipath beginning at __v.__ In this paper randomly ant
Let X be a random vector taking values in R d , let Y be a bounded random variable, and let C be a right censoring random variable operating on Y. It is assumed that C is independent of (X, Y), the distribution function of C is continuous, and the support of the distribution of Y is a proper subset