Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Bicyclic Decompositions of the Complete Digraph into each of the Orientations of a \(4\)-Cycle

Gary D. Coker1, Robert B. Gardner2, Amy Weems2
1 Department of Mathematics The Carolina Academy Lake City, South Carolina 29560
2 Institute of Mathematical and Physical Sciences East Tennessee State University Johnson City, Tennessee 37614 — 0296
  • Published: 31/05/2001

Abstract

A decomposition of a digraph is said to be bicyclic if it admits an automorphism consisting of exactly two disjoint cycles. Necessary and sufficient conditions are given for the existence of bicyclic decompositions of the complete digraph into each of the four orientations of a 4-cycle.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
Gary D. Coker, Robert B. Gardner, Amy Weems. Bicyclic Decompositions of the Complete Digraph into each of the Orientations of a \(4\)-Cycle[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 037. 43-52. DOI: .