A bijection for Eulerian-equivalence classes of totally cyclic orientations

DOI10.1007/s00373-008-0813-9zbMath1228.05179OpenAlexW1991917222MaRDI QIDQ1015438

Terence Y. J. Zhang, Beifang Chen, Arthur L. B. Yang

Publication date: 8 May 2009

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-008-0813-9

Mathematics Subject Classification ID

Graph polynomials (05C31) Combinatorial identities, bijective combinatorics (05A19) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Fourientations and the Tutte polynomial ⋮ Polynomial algorithms for canonical forms of orientations

Cites Work

• Unnamed Item
• Unnamed Item
• Orientations, lattice polytopes, and group arrangements I: Chromatic and tension polynomials of graphs
• Enumerating degree sequences in digraphs and a cycle--cocycle reversing system
• A convolution formula for the Tutte polynomial
• External and internal elements of a matroid basis
• Sinks in acyclic orientations of graphs
• Polynomials associated with nowhere-zero flows
• Orientations, lattice polytopes, and group arrangements. II: Modular and integral flow polynomials of graphs
• The Tutte polynomial
• Acyclic orientations of graphs
• Activity preserving bijections between spanning trees and orientations in graphs
• Tension polynomials of graphs
• On the Interpretation of Whitney Numbers Through Arrangements of Hyperplanes, Zonotopes, Non-Radon Partitions, and Orientations of Graphs
• Bijective proofs of two broken circuit theorems
• Decompositions of Rational Convex Polytopes
• Partitions ofN-Space by Hyperplanes
• A Contribution to the Theory of Chromatic Polynomials

This page was built for publication: A bijection for Eulerian-equivalence classes of totally cyclic orientations