scientific article; zbMATH DE number 2145236
From MaRDI portal
Publication:4657585
zbMath1064.05059MaRDI QIDQ4657585
Publication date: 14 March 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
Disjointness graphs of segments in the space ⋮ Turán-type results for intersection graphs of boxes ⋮ Structural parameterizations for boxicity ⋮ Homothetic polygons and beyond: maximal cliques in intersection graphs ⋮ Coloring curves that cross a fixed curve ⋮ An upper bound on the chromatic number of a circle graph without \(K_4\) ⋮ Coloring Jordan Regions and Curves ⋮ Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane ⋮ Improved algorithms for scheduling unsplittable flows on paths ⋮ Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded ⋮ String graphs have the Erdős-Hajnal property ⋮ Tangencies between families of disjoint regions in the plane ⋮ Decomposition of Multiple Packings with Subquadratic Union Complexity ⋮ Coloring the complements of intersection graphs of geometric figures ⋮ Zarankiewicz’s problem for semilinear hypergraphs ⋮ Box and Segment Intersection Graphs with Large Girth and Chromatic Number ⋮ Coloring translates and homothets of a convex body ⋮ Unnamed Item ⋮ On-line approach to off-line coloring problems on graphs with geometric representations ⋮ Cubicity of interval graphs and the claw number ⋮ Coloring and Maximum Independent Set of Rectangles ⋮ Unnamed Item ⋮ Improved Ramsey-type results for comparability graphs ⋮ On the chromatic number of disjointness graphs of curves ⋮ Outerstring Graphs are $\chi$-Bounded ⋮ Circle graphs are quadratically χ‐bounded ⋮ Lower bounds for boxicity
This page was built for publication:
