= Perfectly orderable graph
{wiki=Perfectly_orderable_graph}
A **perfectly orderable graph** is a type of graph that can be represented in such a way that its vertices can be linearly ordered such that for every edge connecting two vertices \\( u \\) and \\( v \\), one of the following conditions holds: \\( u \\) comes before \\( v \\) in the order or \\( v \\) comes before \\( u \\), and the two vertices do not share any common neighbors that come in between them in the order.
Back to article page
