Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane (Q412277): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejc.2011.09.021 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2090386003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum number of edges in topological graphs with no four pairwise crossing edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-planar graphs have a linear number of edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Label placement by maximum independent set in rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent set of intersection graphs of convex objects in 2D / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection Graphs of Rectangles and Segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing families / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Coloring Problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms in real algebraic geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for MAX–MIN tiling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time approximation schemes for packing and piercing fat objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on the theory of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bipartite analogue of Dilworth's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separator theorems and Turán-type results for planar intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: String graphs and incomparability graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3509401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection patterns of curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turán-type results for partial orders and intersection graphs of convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal packing and covering in the plane are NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparability graphs and intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5749319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering and coloring problems for relatives of intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique is hard to approximate within \(n^{1-\epsilon}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for covering and packing problems in image processing and VLSI / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250205 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of intersection graphs of convex sets in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing number, pair-crossing number, and expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4657585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring relatives of intervals on the plane. I: Chromatic number versus girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring relatives of intervals on the plane. II: Intervals and rays in two directions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Ramsey-Type Result for Convex Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of a Planar Separator Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring arcwise connected sets in the plane. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separators for sphere-packings and nearest neighbor graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4011323 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete and Computational Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of the crossing number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some geometric applications of Dilworth's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5474627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4517186 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circle orders, n-gon orders and the crossing number / rank
 
Normal rank
Property / cites work
 
Property / cites work: On geometric graphs with no \(k\) pairwise parallel edges / rank
 
Normal rank

Latest revision as of 04:01, 5 July 2024

scientific article
Language Label Description Also known as
English
Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane
scientific article

    Statements

    Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane (English)
    0 references
    0 references
    0 references
    4 May 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    \(k\)-quasi-planar topological graph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references