Sign in

Orientations without forbidden patterns on three vertices

By Santiago Guzmán-Pro and César Hernández-Cruz
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
=
0
Loading PDF…
Loading full text...
Similar articles
Loading recommendations...
=
0
x1
Orientations without forbidden patterns on three vertices
Click on play to start listening