The niche graphs of doubly partial orders

From MaRDI portal
Publication:3582500

zbMATH Open1218.05061arXiv0905.3954MaRDI QIDQ3582500FDOQ3582500


Authors: Suh-Ryung Kim, Jung Yeun Lee, Boram Park, Won-Jin Park, Yoshio Sano Edit this on Wikidata


Publication date: 2 September 2010

Abstract: The competition graph of a doubly partial order is known to be an interval graph. The competition-common enemy graph of a doubly partial order is also known to be an interval graph unless it contains a cycle of length 4 as an induced subgraph. In this paper, we show that the niche graph of a doubly partial order is not necessarily an interval graph. In fact, we prove that, for each integer n at least 4, there exists a doubly partial order whose niche graph contains an induced subgraph isomorphic to a cycle of length n. We also show that if the niche graph of a doubly partial order is triangle-free, then it is an interval graph.


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




Recommendations





Cited In (10)





This page was built for publication: The niche graphs of doubly partial orders

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