1 paper · 2 filters
Tatiana Romina Hartinger, Martin Milanič
A graph G is said to be 1-perfectly orientable (1-p.o. for short) if it admits an orientation such that the out-neighborhood of every vertex is a clique in G. The class of 1-p.o. g…