摘要
A path in a digraph is antidirected if the two adjacent edges of the path have opposing orientations. In this paper we give a necessary and sufficient condition for the edges of the complete symmetric graph to be decomposed into isomorphic antidirected paths.
| 原文 | 英語 |
|---|---|
| 頁（從 - 到） | 255-262 |
| 頁數 | 8 |
| 期刊 | Ars Combinatoria |
| 卷 | 61 |
| 出版狀態 | 已發佈 - 2001 |
| 對外發佈 | 是 |
ASJC Scopus subject areas
- 一般數學