Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Biclique Partitions of the Complement of a Directed Cycle

D. A. Gregory1
1Department of Mathematics and Statistics Queen’s University Kingston, Ontario K7L 3N6 CANADA
  • Published: 31/10/1989

Abstract

By a refinement of a rank argument used to prove a directed version of the Graham-Pollak theorem, we show that \(n\) bicliques are needed to partition the arc-set of the complement of a directed cycle.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
D. A. Gregory. Biclique Partitions of the Complement of a Directed Cycle[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 006. 183-187. DOI: .