String graphs and incomparability graphs
From MaRDI portal
Publication:5891657
DOI10.1016/j.aim.2012.03.011zbMath1244.05073OpenAlexW2034523320WikidataQ63321919 ScholiaQ63321919MaRDI QIDQ5891657
Publication date: 20 July 2012
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aim.2012.03.011
Related Items
A crossing lemma for Jordan curves, Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane, Quasiplanar graphs, string graphs, and the Erdős-Gallai problem, String graphs have the Erdős-Hajnal property, Coloring Hasse diagrams and disjointness graphs of curves, On String Graph Limits and the Structure of a Typical String Graph, An algorithm for the maximum weight independent set problem on outerstring graphs, On grids in topological graphs, Applications of a New Separator Theorem for String Graphs, A bipartite strengthening of the crossing Lemma, Unnamed Item, Conflict-free coloring of string graphs, Planar point sets determine many pairwise crossing segments, A sharp threshold phenomenon in string graphs, Bounds on the bend number of split and cocomparability graphs, Ordered graphs and large bi-cliques in intersection graphs of curves, On the chromatic number of disjointness graphs of curves, Outerstring Graphs are $\chi$-Bounded, Large Homogeneous Submatrices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the Ramsey multiplicity of complete graphs
- Turán-type results for partial orders and intersection graphs of convex sets
- A bipartite analogue of Dilworth's theorem
- How many ways can one draw a graph?
- A bipartite strengthening of the crossing Lemma
- String graphs. II: Recognizing string graphs is NP-hard
- String graphs requiring exponential representations
- Comparability graphs and intersection graphs
- Intersection graphs of curves in the plane
- Ramsey-type results for geometric graphs. I
- Recognizing string graphs is decidable
- Crossing number, pair-crossing number, and expansion
- Decidability of string graphs
- Topological graphs with no large grids
- A decomposition theorem for partially ordered sets
- On Sets of Acquaintances and Strangers at any Party
- Coloring k k -free intersection graphs of geometric objects in the plane
- New lower bound techniques for VLSI
- Crossing-Free Subgraphs
- Asymptotic Enumeration of Partial Orders on a Finite Set
- A Ramsey-Type Result for Convex Sets
- Ramsey-type constructions for arrangements of segments
- On grids in topological graphs
- Intersection patterns of curves
- Topology of Thin Film RC Circuits
- Transitiv orientierbare Graphen
- On a problem of K. Zarankiewicz
- Discrete and Computational Geometry
- Recognizing string graphs in NP
