Cuts in matchings of 3-connected cubic graphs

Kolja Knauer (1) , Petru Valicov (1)

1 ACRO - Algorithmique, Combinatoire et Recherche Opérationnelle

We discuss conjectures on Hamiltonicity in cubic graphs (Tait, Barnette, Tutte), on the dichromatic number of planar oriented graphs (Neumann-Lara), and on even graphs in digraphs whose contraction is strongly connected (Hochst\"attler). We show that all of them fit into the same framework related to cuts in matchings. This allows us to find a counterexample to the conjecture of Hochst\"attler and show that the conjecture of Neumann-Lara holds for all planar graphs on at most 26 vertices. Finally, we state a new conjecture on bipartite cubic oriented graphs, that naturally arises in this setting.

Domaines: Mathématique discrète [cs.DM]

Kolja Knauer, Petru Valicov. Cuts in matchings of 3-connected cubic graphs. European Journal of Combinatorics, 2019, 76, pp.27-36. ⟨10.1016/j.ejc.2018.09.004⟩. ⟨hal-01672548v2⟩