On coverings of complete directed graphs by even circuits
From MaRDI portal
Publication:2720657
zbMATH Open0970.05508MaRDI QIDQ2720657
Publication date: 27 June 2001
Published in: Journal of Engineering Mathematics (Xi'an) (Search for Journal in Brave)
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (4)
An extension to ‘an algorithm for rinding a circuit of even length in a directed graph’ ⋮ Packings and coverings of the complete directed multigraph with 3- and 4-circuits ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?)
This page was built for publication: On coverings of complete directed graphs by even circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2720657)
