Cyclically Orientable Graphs
| dc.creator | Speyer, David E | |
| dc.date | 2005-11-09 | |
| dc.date.accessioned | 2026-07-07T06:51:02Z | |
| dc.date.available | 2026-07-07T06:51:02Z | |
| dc.description | Barot, Geiss and Zelevinsky define a notion of a ``cyclically orientable graph'' and use it to devise a test for whether a cluster algebra is of finite type. Barot, Geiss and Zelivinsky's work leaves open the question of giving an efficient characterization of cyclically orientable graphs. In this paper, we give a simple recursive description of cyclically orientable graphs, and use this to give an O(n) algorithm to test whether a graph on $n$ vertices is cyclically orientable. Shortly after writing this paper, I learned that most of its results had been obtained independently by Gurvich; I am placing this paper on the arXiv to spread knowledge of these results. | |
| dc.identifier | https://arxiv.org/abs/math/0511233 | |
| dc.identifier | http://arxiv.org/abs/math/0511233 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/104855 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C38, 05C85 | |
| dc.title | Cyclically Orientable Graphs | |
| dc.type | text |