Nesting directed cycle systems of even length
type: Item
instance of: scholarly article
title: Nesting directed cycle systems of even length
zbMATH Open document ID: 0767.05063
DOI: 10.1016/0195-6698(92)90026-V
author: C. A. Rodger
author: D. R. Stinson
published in: European Journal of Combinatorics
publication date: 1992-09-27T00:00:00Z
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 64846
zbMATH Keywords: digraphs
zbMATH Keywords: cycle systems
MaRDI profile type: Publication
cites work: Existence of resolvable path designs
cites work: On resolvable mixed path designs
cites work: Q3686719
cites work: Directed star decompositions of the complete directed graph
cites work: On the construction of odd cycle systems
cites work: Nesting and almost resolvability of pentagon systems
cites work: Q3980559
cites work: Nesting of cycle systems of odd length
cites work: Q4000778
cites work: The existence of restricted resolvable designs. I: (1,2)-factorizations of \(K_{2n}\)
cites work: The existence of restricted resolvable designs. II: (1,2)-factorizations of \(K_{2n+1}\)
cites work: Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
cites work: The spectrum of nested Steiner triple systems
cites work: Q3807255
cites work: Q3360217
cites work: Decomposition of complete multigraphs into stars
cites work: Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
cites work: Q3348919
full work available at URL: 0195-6698(92)90026-v
OpenAlex ID: W1964088628
description: scientific article; zbMATH DE number 64846