On the competition graphs of d-partial orders

In this paper, we study the competition graphs of d-partial orders and obtain their characterization which extends results given by Cho and Kim (2005). We also show that any graph can be made into the competition graph of a d-partial order for some positive integer d as long as adding isolated vertices is allowed. We then study graphs whose partial order competition dimensions are at most three, where the partial order competition dimension of a graph G is the smallest nonnegative integer d such that G together with some isolated vertices is the competition graph of a d-partial order. (C) 2015 Elsevier B.V. All rights reserved.