Ordering without forbidden patterns

Pavol Hell, Bojan Mohar, Arash Rafiey

Let F be a set of ordered patterns, i.e., graphs whose vertices are linearly ordered. An F-free ordering of the vertices of a graph H is a linear ordering of V(H) such that none of…