Abstract
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.
Details
Title
String graphs and incomparability graphs
Author(s)
Fox, Jacob ; Pach, Janos
Published in
Advances In Mathematics
Volume
230
Pages
1381-1401
Date
2012
Keywords
Language
English
Other identifier(s)
View record in Web of Science
Laboratories
DCG
Record Appears in
Scientific production and competences > SB - School of Basic Sciences > SB Archives > DCG - Chair of Combinatorial Geometry
Scientific production and competences > SB - School of Basic Sciences > Mathematics
Peer-reviewed publications
Work produced at EPFL
Journal Articles
Published
Scientific production and competences > SB - School of Basic Sciences > Mathematics
Peer-reviewed publications
Work produced at EPFL
Journal Articles
Published
Record creation date
2012-06-15