Convex Polygon Intersection Graphs
From MaRDI portal
Publication:3073689
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Recommendations
- On intersection graphs of convex polygons
- Intersection graphs of homothetic polygons
- Intersections of convex bodies
- Polygonal graphs
- Intersection Graphs of Rectangles and Segments
- Interval convex polygons
- Integer representations of convex polygon intersection graphs
- Integer representations of convex polygon intersection graphs
- scientific article; zbMATH DE number 1372027
Cited in
(11)- Complexity of some geometric and topological problems
- Intersection graphs of segments
- Homothetic polygons and beyond: maximal cliques in intersection graphs
- Integer representations of convex polygon intersection graphs
- Intersection graphs of homothetic polygons
- Graph Drawing
- Integer representations of convex polygon intersection graphs
- Algorithm Theory - SWAT 2004
- Representing graphs and hypergraphs by touching polygons in 3D
- Intersection graphs and geometric objects in the plane
- Beyond homothetic polygons: recognition and maximum clique
This page was built for publication: Convex Polygon Intersection Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3073689)