Loading...
research article
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.
Type
research article
Web of Science ID
WOS:000304386400023
Authors
Publication date
2012
Published in
Volume
230
Start page
1381
End page
1401
Peer reviewed
REVIEWED
EPFL units
Available on Infoscience
June 15, 2012
Use this identifier to reference this record