  We shall show that there exists only one duality pair for ordered graphs. We
will also define a corresponding definition of $\chi$-boundedness for ordered
graphs and show that all ordered graphs are $\chi$-bounded and prove an analogy
of Gyarf\'as-Sumner conjecture for ordered graphs. We shall conclude with
showing that these results hold for directed ordered graphs, but they do not
hold for oriented ordered graphs.
