On the partial order competition dimensions of chordal graphs

From MaRDI portal
Publication:1786874

DOI10.1016/J.DAM.2016.08.020zbMATH Open1396.05044arXiv1505.00204OpenAlexW2963506471MaRDI QIDQ1786874FDOQ1786874


Authors: Jihoon Choi, Suh-Ryung Kim, Jung Yeun Lee, Yoshio Sano Edit this on Wikidata


Publication date: 25 September 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Abstract: Choi {it et al.} [{J.~Choi, K.~S.~Kim, S.~-R.~Kim, J.~Y.~Lee, and Y.~Sano}: {On the competition graphs of d-partial orders}, emph{Discrete Applied Mathematics} (2015), exttt{http://dx.doi.org/10.1016/j.dam.2015.11.004}] introduced the notion of the partial order competition dimension of a graph. It was shown that complete graphs, interval graphs, and trees, which are chordal graphs, have partial order competition dimensions at most three. In this paper, we study the partial order competition dimensions of chordal graphs. We show that chordal graphs have partial order competition dimensions at most three if the graphs are diamond-free. Moreover, we also show the existence of chordal graphs containing diamonds whose partial order competition dimensions are greater than three.


Full work available at URL: https://arxiv.org/abs/1505.00204




Recommendations




Cites Work


Cited In (4)





This page was built for publication: On the partial order competition dimensions of chordal graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1786874)