Graph homomorphisms and inversion diameter
Carmen Arana
(joint work with T. Bellitto, H. Buffière, Q. Chuet, T. Pierron and A. Reinald)

Given an orientation of a graph, an inversion is the operation that consists of reversing all arrows in an induced subgraph. The inversion diameter of a graph is the maximum number of inversions necessary to get from any orientation of the graph to another. We show upper bounds on this invariant for various classes of graphs using 2-edge-colored homomorphisms.