Abstract
We introduce canonical forms that represent certain equivalence classes of totally cyclic and acyclic orientations of graphs and present a polynomial algorithms for their constructions. The forms are used in new formulas evaluating tension and flow polynomials on graphs.
Similar content being viewed by others
References
Bang-Jensen J, Gutin G (2007) Digraphs: theory, algorithms and applications. Springer, Berlin
Beck M, Braun B (2012) Nowhere-harmonic colorings of graphs. Proc Am Math Soc 140:47–63
Beck M, Zaslavsky T (2006) Inside-out polytopes. Adv Math 205:134–162
Breuer F, Dall A (2011) Bounds on the coefficients of tension and flow polynomials. J Algebr Comb 33:465–482
Breuer F, Sanyal R (2012) Ehrhart theory, modular flow reciprocity, and the Tutte polynomial. Math Z 270:1–18
Chen B (2010) Orientations, lattice polytopes, and group arrangements I: chromatic and tension polynomials of graphs. Ann Comb 13:425–452
Chen B, Yang ALB, Zhang TYJ (2008) A bijection for Eulerian-equivalence classes of totally cyclic orientations. Graphs Combin 24:519–530
Greene C, Zaslavsky T (1983) On the interpretation of Whitney numbers through arrangements of hyperplanes, zonotopes, non-Radon partitions, and orientations of graphs. Trans Am Math Soc 280:97–126
Kochol M (2002a) Polynomials associated with nowhere-zero flows. J Combin Theory B 84:260–269
Kochol M (2002b) Tension polynomials of graphs. J Graph Theory 40:137–146
Tarjan R (1972) Depth-first search and linear graph algorithms. SIAM J Comput 1:146–160
Acknowledgments
Partially supported by grant VEGA 2/0017/14.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kochol, M. Polynomial algorithms for canonical forms of orientations. J Comb Optim 31, 218–222 (2016). https://doi.org/10.1007/s10878-014-9735-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-014-9735-z