Cyclically Orientable Graphs

Details Cyclically Orientable Graphs Cyclically Orientable Graphs

2005-11-09

arxiv.org/abs/math/0511233v1

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Cyclically Orientable Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Cyclically Orientable Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cyclically Orientable Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-104314