Stable set meeting every longest paths
Résumé
Laborde, Payan and Xuong conjectured that every digraph has a stable set meeting every longest path. We prove that this conjecture holds for digraphs with stability at most 2.
Domaines
Autre [cs.OH]
Loading...