Given a set \(F\) of oriented graphs, a graph \(G\) is an \(F\)-graph if it admits an \(F\)-free orientation. Building on previous work by Bang-Jensen and Urrutia, we propose a master algorithm that determines if a graph admits an \(F\)-free orientation when \(F\) is a subset of the orientations of... Show more

January 13, 2023

Loading full text...

Similar articles

Loading recommendations...

x1

Orientations without forbidden patterns on three vertices

Click on play to start listening