Abstract
In this paper, we extend the study on packing and covering of complete directed graph Dt with Mendelsohn triples [6]. Mainly, the maximum packing of Dt - P and DtUP with Mendelsohn triples are obtained respectively where P is a vertex-disjoint union of directed cycles in Dt.
Original language | English |
---|---|
Pages (from-to) | 165-182 |
Number of pages | 18 |
Journal | Ars Combinatoria |
Volume | 91 |
State | Published - 1 Apr 2009 |
Keywords
- Complete digraph
- Maximum packing
- Mendelsohn triples