scientific article
From MaRDI portal
Publication:3348944
zbMath0727.05056MaRDI QIDQ3348944
Jaroslav Nešetřil, Jan Kratochvíl
Publication date: 1990
Full work available at URL: https://eudml.org/doc/17810
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Finding a Maximum Clique in a Grounded 1-Bend String Graph ⋮ Disjointness graphs of segments in the space ⋮ A special planar satisfiability problem and a consequence of its NP- completeness ⋮ Complexity and Polynomially Solvable Special Cases of QUBO ⋮ Intersection graphs of homothetic polygons ⋮ Maximum Independent Set on $$B_1$$ B 1 -VPG Graphs ⋮ Max point-tolerance graphs ⋮ On intersection representations of co-planar graphs ⋮ Homothetic polygons and beyond: maximal cliques in intersection graphs ⋮ The clique problem in ray intersection graphs ⋮ Segment representation of a subclass of co-planar graphs ⋮ Proper colorability of segment intersection graphs ⋮ On streaming algorithms for geometric independent set and clique ⋮ Many disjoint edges in topological graphs ⋮ On the obfuscation complexity of planar graphs ⋮ On the speed of algebraically defined graph classes ⋮ On plane subgraphs of complete topological drawings ⋮ An algorithm for the maximum weight independent set problem on outerstring graphs ⋮ Matching colored points with rectangles ⋮ Many disjoint edges in topological graphs ⋮ Thresholds for classes of intersection graphs ⋮ Unnamed Item ⋮ Planar point sets determine many pairwise crossing segments ⋮ Computing maximum independent set on outerstring graphs and their relatives ⋮ Covering and packing of triangles intersecting a straight line ⋮ Maximum Independent Set in 2-Direction Outersegment Graphs ⋮ Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid ⋮ On the chromatic number of disjointness graphs of curves ⋮ On the stab number of rectangle intersection graphs ⋮ Efficient Local Representations of Graphs ⋮ On the stability number of the edge intersection of two graphs. ⋮ The maximum clique problem in multiple interval graphs
