𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Packings of the complete directed graph withm-circuits

✍ Scribed by Liang Zhihe; Kang Qingde

Book ID
107502158
Publisher
SP Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
Year
1998
Tongue
English
Weight
407 KB
Volume
13
Category
Article
ISSN
1005-1031

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Packings and coverings of the complete d
Packings and coverings of the complete directed multigraph with 3- and 4-circuits
✍ F.E. Bennett; J. Yin πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 337 KB

Let 2DK~, denote the complete directed multigraph with v vertices, where any two distinct vertices x and y are joined by 2 arcs (x,y) and 2 arcs (y,x). By a k-circuit we mean a directed cycle of length k. In this paper, we consider the problem of finding maximal packings and minimal coverings of 2DK

Directed star decompositions of the comp
Directed star decompositions of the complete directed graph
✍ Charles J. Colbourn; D. G. Hoffman; C. A. Rodger πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 545 KB

## Abstract An (__s, t__)‐directed star is a directed graph with __s__ + __t__ + 1 vertices and s + t arcs; s vertices have indegree zero and outdegree one, __t__ have indegree one and outdegree zero, and one has indegree __s__ and outdegree __t__. An (__s, t__)‐directed star decomposition is a par

Maximum packings of the complete graph w
Maximum packings of the complete graph with uniform length cycles
✍ Daniel Horsley πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 86 KB

In this paper we find the maximum number of pairwise edgedisjoint m-cycles which exist in a complete graph with n vertices, for all values of n and m with 3 ≀ m ≀ n.