Coloring K_k-free intersection graphs of geometric objects in the plane
From MaRDI portal
Publication:412277
Recommendations
- Coloring k k -free intersection graphs of geometric objects in the plane
- Coloring the complements of intersection graphs of geometric figures
- Colouring triangle-free intersection graphs of boxes on the plane
- scientific article; zbMATH DE number 2145236
- Coloring intersection graphs of arc-connected sets in the plane
- Coloring intersection graphs of arcwise connected sets in the plane
- On \(k\)-intersection edge colourings
- Triangle-free geometric intersection graphs with large chromatic number
Cites work
- scientific article; zbMATH DE number 66689 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1303579 (Why is no real title available?)
- scientific article; zbMATH DE number 2080111 (Why is no real title available?)
- scientific article; zbMATH DE number 1534394 (Why is no real title available?)
- scientific article; zbMATH DE number 2145236 (Why is no real title available?)
- scientific article; zbMATH DE number 5035595 (Why is no real title available?)
- scientific article; zbMATH DE number 4183452 (Why is no real title available?)
- A Ramsey-Type Result for Convex Sets
- A Separator Theorem for Planar Graphs
- A bipartite analogue of Dilworth's theorem
- Algorithms in real algebraic geometry
- Applications of a Planar Separator Theorem
- Applications of the crossing number
- Approximation algorithms for MAX–MIN tiling
- Approximation schemes for covering and packing problems in image processing and VLSI
- Circle orders, n-gon orders and the crossing number
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Coloring relatives of intervals on the plane. I: Chromatic number versus girth
- Colouring arcwise connected sets in the plane. I
- Colouring relatives of intervals on the plane. II: Intervals and rays in two directions
- Comparability graphs and intersection graphs
- Covering and coloring problems for relatives of intervals
- Crossing families
- Crossing number, pair-crossing number, and expansion
- Discrete and Computational Geometry
- Efficient approximation algorithms for tiling and packing problems with rectangles
- Erdős-Hajnal-type results on intersection patterns of geometric objects
- Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
- Independent set of intersection graphs of convex objects in 2D
- Intersection Graphs of Rectangles and Segments
- Intersection patterns of curves
- Label placement by maximum independent set in rectangles
- On a Coloring Problem.
- On geometric graphs with no k pairwise parallel edges
- On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs
- On the chromatic number of intersection graphs of convex sets in the plane
- On the maximum number of edges in topological graphs with no four pairwise crossing edges
- Optimal packing and covering in the plane are NP-complete
- Polynomial-time approximation schemes for packing and piercing fat objects
- Quasi-planar graphs have a linear number of edges
- Separator theorems and Turán-type results for planar intersection graphs
- Separators for sphere-packings and nearest neighbor graphs
- Some geometric applications of Dilworth's theorem
- Some remarks on the theory of graphs
- String graphs and incomparability graphs
- Turán-type results for partial orders and intersection graphs of convex sets
Cited in
(35)- Triangle-free intersection graphs of line segments with large chromatic number
- Quasiplanar graphs, string graphs, and the Erdős-Gallai problem
- Coloring curves that cross a fixed curve
- Geometric intersection patterns and the theory of topological graphs
- Coloring intersection graphs of arc-connected sets in the plane
- Intersection patterns of curves
- Colouring arcwise connected sets in the plane. I
- On the speed of algebraically defined graph classes
- On the chromatic number of intersection graphs of convex sets in the plane
- Coloring the complements of intersection graphs of geometric figures
- Quasi-planar Graphs
- Two-Planar Graphs Are Quasiplanar
- The crossing Tverberg theorem
- On-line approach to off-line coloring problems on graphs with geometric representations
- Coloring non-crossing strings
- Bounds on the chromatic number of intersection graphs of sets in the plane
- On dominating set of some subclasses of string graphs
- The discharging method in combinatorial geometry and the Pach-Sharir conjecture
- Triangle-free geometric intersection graphs with no large independent sets
- Coloring curves that cross a fixed curve
- Applications of a new separator theorem for string graphs
- Many disjoint edges in topological graphs
- The maximum number of tangencies among convex regions with a triangle-free intersection graph
- The crossing Tverberg theorem
- On the Size of Planarly Connected Crossing Graphs
- On quasi-planar graphs: clique-width and logical description
- On the chromatic number of disjointness graphs of curves
- Quasiplanar graphs, string graphs, and the Erdős-Gallai problem
- Coloring k k -free intersection graphs of geometric objects in the plane
- On approximating MIS over B1-VPG graphs*
- Outerstring graphs are \(\chi \)-bounded
- On planar intersection graphs with forbidden subgraphs
- Disjoint edges in complete topological graphs
- Coloring decompositions of complete geometric graphs
- An algorithm for the maximum weight independent set problem on outerstring graphs
This page was built for publication: Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412277)
