Packings and coverings of the complete directed multigraph with 3- and 4-circuits
type: Item
instance of: scholarly article
title: Packings and coverings of the complete directed multigraph with 3- and 4-circuits
zbMATH Open document ID: 0870.05059
DOI: 10.1016/0012-365X(95)00302-D
published in: Discrete Mathematics
publication date: 1997-06-10T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 1019018
zbMATH Keywords: directed graph
zbMATH Keywords: Mendelsohn design
zbMATH Keywords: complete directed multigraph
zbMATH Keywords: directed cycle
zbMATH Keywords: maximal packings
zbMATH Keywords: minimal coverings
zbMATH Keywords: packing number
zbMATH Keywords: covering number
author: Frank E. Bennett
author: Jianxing Yin
MaRDI profile type: Publication
cites work: Q3981360
cites work: An application of the solution of Kirkman's schoolgirl problem: The decomposition of the symmetric oriented complete graph into 3-circuits
cites work: Decomposition of the complete directed graph into k-circuits
cites work: Q3872478
cites work: Q4198779
cites work: Q5619847
full work available at URL: 0012-365x(95)00302-d
OpenAlex ID: W2074137367
Recommended article: Packings of the complete directed graph with \(m\)-circuits
Recommended article: Coverings and packings of complete directed graphs by odd circuits
Recommended article: Q4390675
Recommended article: Q4211757
Recommended article: On coverings of complete directed graphs by even circuits
Recommended article: Packing complete multipartite graphs with 4-cycles
Recommended article: Packings and coverings of various complete graphs with the 4-cycle with a pendant edge
Recommended article: Q5193694
Recommended article: Constructions of optimal packing and covering of the complete multigraph with applications
Recommended article: Packing \(\lambda\)-fold complete multipartite graphs with 4-cycles
description: scientific article; zbMATH DE number 1019018