arXiv Analytics

Sign in

arXiv:1501.03591 [math.CO]AbstractReferencesReviewsResources

On the competition graphs of $d$-partial orders

Jihoon Choi, Kyeong Seok Kim, Suh-Ryung Kim, Jung Yeun Lee, Yoshio Sano

Published 2015-01-15Version 1

In this paper, we study the competition graphs of $d$-partial orders and obtain their characterization which extends results given by Cho and Kim~\cite{chokim} in 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 introduce the notion of the partial order competition dimension of a graph and study graphs whose partial order competition dimensions are at most three.

Related articles: Most relevant | Search more
arXiv:2009.09881 [math.CO] (Published 2020-09-21)
The triangle-free graphs which are competition graphs of multipartite tournaments
arXiv:1905.10966 [math.CO] (Published 2019-05-27)
Using $p$-row graphs to study $p$-competition graphs
arXiv:1103.1028 [math.CO] (Published 2011-03-05, updated 2011-10-02)
The competition number of a graph and the dimension of its hole space