String graphs and incomparability graphs

Given a collection C of curves in the plane, its string graph is defined as the graph with vertex set C, in which two curves in C are adjacent if and only if they intersect. Given a partially ordered set (P, <), its incomparability graph is the graph with vertex set P, in which two elements of P are adjacent if and only if they are incomparable.


Published in:
Advances In Mathematics, 230, 1381-1401
Year:
2012
Keywords:
Laboratories:




 Record created 2012-06-15, last modified 2018-03-17


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)