2014/06/04 by Jihoon Choi, Kyeong Seok Kim, Choi, Jihoon +7
Computer Science · Engineering · Mathematics · #05C20 #05C75 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Interconnection Networks and Systems #graph theory and CDMA systems #math.CO #msc:05C20 #msc:05C75
paper · pdf · doi:10.48550/arxiv.1406.0940
14 pages, 5 figures
openalex publication_date 2014/06/04 · arxiv created 2016/01/08 · arxiv updated 2016/01/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper, we study the competition graphs of d-partial orders and obtain their characterization which extends results given by Cho and Kim \citechokim 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.