| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4649313 | Discrete Mathematics | 2009 | 5 Pages |
Abstract
We investigate transitive decompositions of disconnected graphs, and show that these behave very differently from a related class of algebraic graph decompositions, known as homogeneous factorisations. We conclude that although the study of homogeneous factorisations admits a natural reduction to those cases where the graph is connected, the study of transitive decompositions does not.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Geoffrey Pearce,