Title of article
A communication problem and directed triple systems Original Research Article
Author/Authors
Andr?s Gy?rf?s، نويسنده , , R.H. Schelp، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1998
Pages
9
From page
139
To page
147
Abstract
The solution of a specific network problem is shown to be equivalent to the decomposition of a certain complete symmetric digraph into edge disjoint balanced transitive triples. Further related decomposition results and conjectures are presented as well.
Keywords
Networks , Transitive triples , Complete symmetric digraph , Pairable graph
Journal title
Discrete Applied Mathematics
Serial Year
1998
Journal title
Discrete Applied Mathematics
Record number
884763
Link To Document