The maximum number of tangencies among convex regions with a triangle-free intersection graph

DOI10.1007/978-1-4614-0110-0_3zbMATH Open1276.52002OpenAlexW125835800MaRDI QIDQ2849796FDOQ2849796

Authors: Eyal Ackerman 

Publication date: 25 September 2013

Published in: Thirty Essays on Geometric Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-0110-0_3

Recommendations

• Tangencies between families of disjoint regions in the plane
• Tangencies between families of disjoint regions in the plane
• On planar intersection graphs with forbidden subgraphs
• On the chromatic number of intersection graphs of convex sets in the plane
• Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane

zbMATH Keywords

convex bodiesintersection graphnumber of tangent pairs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Convex sets in (2) dimensions (including convex curves) (52A10)

Cited In (5)

• Tangencies between families of disjoint regions in the plane
• The maximum number of ways to stab n convex nonintersecting sets in the plane is 2n-2
• Tangencies between families of disjoint regions in the plane
• Discrete and Computational Geometry
• On the number of tangencies among 1-intersecting \(x\)-monotone curves

This page was built for publication: The maximum number of tangencies among convex regions with a triangle-free intersection graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849796)