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)

Recommendations

Quasi-planar graphs have a linear number of edges
Coloring k _k -free intersection graphs of geometric objects in the plane
On the maximum number of edges in quasi-planar graphs
Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane
Applications of a new separator theorem for string graphs

Cites work

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

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)