Abstract
Cyclic orders of graphs and their equivalence have been promoted by Bessy and Thomassé’s recent proof of Gallai’s conjecture. We explore this notion further: we prove that two cyclic orders are equivalent if and only if the winding number of every circuit is the same in the two. The proof is short and provides a good characterization and a polynomial algorithm for deciding whether two orders are equivalent.
We then derive short proofs of Gallai’s conjecture and a theorem “polar to” the main result of Bessy and Thomassé, using the duality theorem of linear programming, total unimodularity, and the new result on the equivalence of cyclic orders.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Bessy and S. Thomassé: Spanning a strong digraph by α circuits: A proof of Gallai’s conjecture; Combinatorica 27(6) (2007), 659–667.
P. Charbit: Circuits in Graphs and Digraphs via Embeddings, PhD thesis, Université Claude Bernard, Lyon, December 2005.
T. Gallai: Problem 15, in: Theory of Graphs and its Applications (M. Fiedler, ed.), Czech. Acad. Sci. Publ., 1964, p. 161.
A. Schrijver: Combinatorial Optimization, Springer, 2003.
A. Sebő: Minmax Relations for Cyclically Ordered Digraphs, Journal of Combinatorial Theory, Ser. B 97(4) (2007), 518–552.
X. Zhu: Circular chromatic number: a survey; Discrete Mathematics 229(1–3) (2001), 371–410.