scientific article; zbMATH DE number 4200260
From MaRDI portal
Publication:3348944
zbMATH Open0727.05056MaRDI QIDQ3348944FDOQ3348944
Publication date: 1990
Full work available at URL: https://eudml.org/doc/17810
Title of this publication is not available (Why is that?)
Recommendations
Cited In (39)
- Maximum bipartite subgraphs of geometric intersection graphs
- On the stability number of the edge intersection of two graphs.
- Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs
- Proper colorability of segment intersection graphs
- On the obfuscation complexity of planar graphs
- On the speed of algebraically defined graph classes
- Intersection graphs of homothetic polygons
- The clique problem in ray intersection graphs
- Segment representation of a subclass of co-planar graphs
- Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
- Finding a Maximum Clique in a Grounded 1-Bend String Graph
- Intersection graphs of segments
- The Clique Problem in Ray Intersection Graphs
- On intersection representations of co-planar graphs
- Planar point sets determine many pairwise crossing segments
- Many disjoint edges in topological graphs
- Efficient Local Representations of Graphs
- Title not available (Why is that?)
- On the stab number of rectangle intersection graphs
- A special planar satisfiability problem and a consequence of its NP- completeness
- Thresholds for classes of intersection graphs
- Maximum Independent Set in 2-Direction Outersegment Graphs
- Homothetic polygons and beyond: maximal cliques in intersection graphs
- Proper colorability of segment intersection graphs
- Title not available (Why is that?)
- Covering and packing of triangles intersecting a straight line
- Max point-tolerance graphs
- On the chromatic number of disjointness graphs of curves
- Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid
- Disjointness graphs of segments in the space
- The maximum clique problem in multiple interval graphs
- Maximum Independent Set on $$B_1$$ B 1 -VPG Graphs
- Matching colored points with rectangles
- Many disjoint edges in topological graphs
- On plane subgraphs of complete topological drawings
- Complexity and Polynomially Solvable Special Cases of QUBO
- On streaming algorithms for geometric independent set and clique
- An algorithm for the maximum weight independent set problem on outerstring graphs
- Computing maximum independent set on outerstring graphs and their relatives
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3348944)
