1-Factorizations of cartesian products of regular graphs
β Scribed by Anton Kotzig
- Publisher
- John Wiley and Sons
- Year
- 1979
- Tongue
- English
- Weight
- 562 KB
- Volume
- 3
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract A special type of surgery developed by A. T. White and later used by the author to construct orientable quadrilateral embeddings of Cartesian products of graphs is here expanded to cover the nonorientable case as well. This enables the nonorientable genus of many families of Cartesian p
It is shown that for each r G 3, a random r-regular graph on 2 n vertices is equivalent in a certain sense to a set of r randomly chosen disjoint perfect matchings of the 2 n vertices, as n Βͺ Ο±. This equivalence of two sequences of probabilistic spaces, called contiguity, occurs when all events almo
A p-factor of a graph G is a regular spanning subgraph of degree p . For G regular of degree d ( G ) and order 2n, let ( p l , ..., p,) be a partition of d ( G ) , so that p i > 0 ( I S i S r ) and p , i i pr = d(G). If H I . ..., H, are edge-disjoint regular spanning subgraphs of G of degrees p I ,