Pages that link to "Item:Q777485"

The following pages link to On the chromatic number of disjointness graphs of curves (Q777485):

Displaying 8 items.

• A better upper bound on the chromatic number of (cap, even-hole)-free graphs (Q1981707) (← links)
• Improved Ramsey-type results for comparability graphs (Q4987258) (← links)
• Hasse diagrams with large chromatic number (Q5006387) (← links)
• The Chromatic Number of the Disjointness Graph of the Double Chain (Q5130745) (← links)
• Coloring polygon visibility graphs and their generalizations (Q6038590) (← 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)