Connectivity properties of some transformation graphs
Many combinatorial problems can be formulated as "can we transform configuration 1 into configuration 2 if certain transformations are allowed?" In order to study such questions, we introduce a so-called transformation graph. This graph has the set of all possible configurations as its ver...
| Main Author: | |
|---|---|
| Published: |
London School of Economics and Political Science (University of London)
2013
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.574161 |