Polynomial algorithms for canonical forms of orientations
From MaRDI portal
Publication:5963618
Recommendations
Cites work
- A bijection for Eulerian-equivalence classes of totally cyclic orientations
- Bounds on the coefficients of tension and flow polynomials
- Depth-First Search and Linear Graph Algorithms
- Digraphs
- Ehrhart theory, modular flow reciprocity, and the Tutte polynomial
- Inside-out polytopes
- Nowhere-harmonic colorings of graphs
- On the Interpretation of Whitney Numbers Through Arrangements of Hyperplanes, Zonotopes, Non-Radon Partitions, and Orientations of Graphs
- Orientations, lattice polytopes, and group arrangements I: Chromatic and tension polynomials of graphs
- Polynomials associated with nowhere-zero flows
- Tension polynomials of graphs
Cited in
(4)
This page was built for publication: Polynomial algorithms for canonical forms of orientations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963618)