On competition graphs of n-tuply partial orders

Abstract

Studying competition graphs of interesting digraphs is a basic open problem in the study of competition graphs. In this context, Cho and Kim [1] studied competition graphs of doubly partial orders and gave a nice characterization of the competition graphs of doubly partial orders. In this paper, we extend their results to a general case, which turns out to be quite interesting. Especially, we take a close look at the competition graphs of triply partial orders to present their meaningful properties.

9 Figures and Tables

Cite this paper

@inproceedings{Choi2014OnCG, title={On competition graphs of n-tuply partial orders}, author={Jihoon Choi and Kyeong Seok Kim and Jung Yeun Lee}, year={2014} }