The uncrossing partial order on matchings is Eulerian.

Published in: J. Comb. Theory, Ser. A (2015)

Keyphrases

partial order
partially ordered
total order
partial ordering
stable marriage
lattice structure
totally ordered
conceptual graphs
data sets
search algorithm
set theory
vertex cover
data structure
search space
dominance relation
causal links