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

Covering Multigraphs by Simple Circuits

โœ Scribed by Alon, N.; Tarsi, M.

Book ID
118213015
Publisher
Society for Industrial and Applied Mathematics
Year
1985
Weight
598 KB
Volume
6
Category
Article
ISSN
0196-5212

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Covering Graphs by Simple Circuits
Covering Graphs by Simple Circuits
โœ Itai, Alon; Lipton, Richard J.; Papadimitriou, Christos H.; Rodeh, M. ๐Ÿ“‚ Article ๐Ÿ“… 1981 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 448 KB
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