Quasiplanar graphs, string graphs, and the Erdős-Gallai problem

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Erd?s problems and related topics of discrete geometry (52C10)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Generalized Nested Dissection
Triangle-free geometric intersection graphs with no large independent sets
Research Problems in Discrete Geometry
Triangle-free intersection graphs of line segments with large chromatic number
A Separator Theorem for String Graphs and its Applications
Applications of a New Separator Theorem for String Graphs
Separator theorems and Turán-type results for planar intersection graphs
On a Coloring Problem.
Quasi-planar graphs have a linear number of edges
K^s-Free Graphs Without Large K^r-Free Subgraphs
On generalized Ramsey numbers of Erdős and Rogers
The Construction of Certain Graphs
On $K_s$-free subgraphs in $K_{s+k}$-free graphs and vertex Folkman numbers
On the maximum number of edges in quasi-planar graphs
$K_4$-free graphs without large induced triangle-free subgraphs
Large K_r‐free subgraphs in K_s‐free graphs and some other Ramsey‐type problems
Bounding Ramsey numbers through large deviation inequalities
On the chromatic number of multiple interval graphs and overlap graphs
Covering and coloring polygon-circle graphs
Coloring intersection graphs of $x$-monotone curves in the plane
On geometric graphs with no $k$ pairwise parallel edges
Colouring arcwise connected sets in the plane. I
On the maximum number of edges in topological graphs with no four pairwise crossing edges
Coloring $K_{k}$-free intersection graphs of geometric objects in the plane
String graphs and incomparability graphs
On-line approach to off-line coloring problems on graphs with geometric representations
Separators in region intersection graphs
Coloring curves that cross a fixed curve
Circle graphs are quadratically χ‐bounded
Improved bounds for the Erdős-Rogers function
Quasi-planar Graphs
Outerstring Graphs are $\chi$-Bounded
Improved bounds for colouring circle graphs
Coloring and Maximum Weight Independent Set of Rectangles
String graphs have the Erdős-Hajnal property

This page was built for publication: Quasiplanar graphs, string graphs, and the Erdős-Gallai problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6563995)