论文信息 - Polynomial algorithms for canonical forms of orientations

Polynomial algorithms for canonical forms of orientations

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.

Martin Kochol | M. Kochol

[1] Felix Breuer,et al. Bounds on the coefficients of tension and flow polynomials , 2010, 1004.3470.

[2] Gregory Gutin,et al. Digraphs - theory, algorithms and applications , 2002 .

[3] Martin Kochol,et al. Polynomials Associated with Nowhere-Zero Flows , 2002, J. Comb. Theory, Ser. B.

[4] Beifang Chen,et al. Orientations, Lattice Polytopes, and Group Arrangements I: Chromatic and Tension Polynomials of Graphs , 2007, 0706.3273.

[5] Martin Kochol,et al. Tension polynomials of graphs , 2002 .

[6] Felix Breuer,et al. Ehrhart theory, modular flow reciprocity, and the Tutte polynomial , 2012 .

[7] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[8] Thomas Zaslavsky,et al. Inside-out polytopes , 2003, math/0309330.

[9] M. Beck,et al. Nowhere-Harmonic Colorings of Graphs , 2009, 0907.1272.

[10] Thomas Zaslavsky,et al. ON THE INTERPRETATION OF WHITNEY NUMBERS THROUGH ARRANGEMENTS OF HYPERPLANES, ZONOTOPES, NON-RADON PARTITIONS, AND ORIENTATIONS OF GRAPHS , 1983 .

[11] Beifang Chen,et al. A Bijection for Eulerian-equivalence Classes of Totally Cyclic Orientations , 2008, Graphs Comb..