The niche graphs of doubly partial orders

Details The niche graphs of doubly partial orders The niche graphs of doubly partial orders

2009-05-25

arxiv.org/abs/0905.3954v1

Congressus Numerantium 195 (2009) 19-32

Mathematics

Combinatorics

14 pages, 3 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The niche graphs of doubly partial orders does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The niche graphs of doubly partial orders, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The niche graphs of doubly partial orders will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-294261