The following pages link to Disjointness graphs of segments (Q4580137):
Displaying 12 items.
- On the chromatic number of disjointness graphs of curves (Q777485) (← links)
- Coloring Hasse diagrams and disjointness graphs of curves (Q2206854) (← links)
- Hasse diagrams with large chromatic number (Q5006387) (← links)
- (Q5088986) (← links)
- Box and Segment Intersection Graphs with Large Girth and Chromatic Number (Q5162871) (← links)
- Disjoint edges in geometric graphs (Q5893809) (← links)
- Disjoint edges in geometric graphs (Q5925578) (← links)
- On the connectivity of the disjointness graph of segments of point sets in general position in the plane (Q6045406) (← links)
- Disjointness graphs of short polygonal chains (Q6144392) (← links)
- Disjointness graphs of segments in \(\mathbb{R}^2\) are almost all Hamiltonian (Q6184321) (← links)
- Coloring lines and Delaunay graphs with respect to boxes (Q6201036) (← links)
- The maximum chromatic number of the disjointness graph of segments on \(n\)-point sets in the plane with \(n\leq 16\) (Q6614724) (← links)
