Refining the hierarchies of classes of geometric intersection graphs

DOI10.1016/j.endm.2016.09.039zbMath1356.05026arXiv1603.08974OpenAlexW2595398522MaRDI QIDQ5965767

Miha Jejčič, Sergio Cabello

Publication date: 13 February 2017

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1603.08974

zbMATH Keywords

disk graphsintersection graphsstring graphssegment graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (2)

The intersection graph of the disks with diameters the sides of a convex \(n\)-gon ⋮ Unnamed Item

Cites Work

• Triangle-free intersection graphs of line segments with large chromatic number
• Coloring intersection graphs of \(x\)-monotone curves in the plane
• String graphs requiring exponential representations
• Intersection graphs of segments
• String graphs and separators
• Complexity of Some Geometric and Topological Problems

This page was built for publication: Refining the hierarchies of classes of geometric intersection graphs