Pages that link to "Item:Q5931448"
From MaRDI portal
The following pages link to Representing graphs by disks and balls (a survey of recognition-complexity results) (Q5931448):
Displaying 29 items.
- On distance constrained labeling of disk graphs (Q703553) (← links)
- Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs (Q867854) (← links)
- On contact numbers of totally separable unit sphere packings (Q898124) (← links)
- Analogs of Steiner's porism and Soddy's hexlet in higher dimensions via spherical codes (Q1791629) (← links)
- On-line coloring of geometric intersection graphs (Q1862127) (← links)
- Contact graphs of unit sphere packings revisited (Q1956324) (← links)
- Discrete harmonic functions on infinite penny graphs (Q2042257) (← links)
- Unit disk representations of embedded trees, outerplanar and multi-legged graphs (Q2151453) (← links)
- Arrangements of orthogonal circles with many intersections (Q2151458) (← links)
- Contact graphs of ball packings (Q2200926) (← links)
- Representing graphs and hypergraphs by touching polygons in 3D (Q2206825) (← links)
- On arrangements of orthogonal circles (Q2206852) (← links)
- \( L ( 2 , 1 )\)-labeling of disk intersection graphs (Q2306585) (← links)
- A tight bound for online colouring of disk graphs (Q2382668) (← links)
- Optimal polygonal representation of planar graphs (Q2429359) (← links)
- Sphericity, cubicity, and edge clique covers of graphs (Q2495913) (← links)
- The number of disk graphs (Q2509768) (← links)
- Weak Unit Disk and Interval Representation of Graphs (Q2827814) (← links)
- Contact Representations of Graphs in 3D (Q3449802) (← links)
- Approximation Algorithms for Geometric Intersection Graphs (Q3508563) (← links)
- Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count (Q4625139) (← links)
- Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs (Q4961756) (← links)
- Intersection graphs of homothetic polygons (Q5301023) (← links)
- On the Complexity of Some Geometric Problems With Fixed Parameters (Q5856668) (← links)
- Arrangements of orthogonal circles with many intersections (Q5886035) (← links)
- Intersection graphs of maximal sub-polygons of \(k\)-lizards (Q6117086) (← links)
- Harmonic functions of polynomial growth on infinite penny graphs (Q6133811) (← links)
- Adjacency graphs of polyhedral surfaces (Q6541985) (← links)
- On the complexity of target set selection in simple geometric networks (Q6606994) (← links)
