Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 255-262 |
| Number of pages | 8 |
| Journal | Ars Combinatoria |
| Volume | 61 |
| Publication status | Published - 2001 |
| Externally published | Yes |
ASJC Scopus subject areas
- General Mathematics