Colouring the triangles determined by a point set
Let <em>P</em> be a set of <em>n</em> points in general position in the plane. We study the chromatic number of the intersection graph of the open triangles determined by <em>P</em>. It is known that this chromatic number is at least <em>n</em><sup&...
Main Authors: | Ruy Fabila-Monroy, David R. Wood |
---|---|
Format: | Article |
Language: | English |
Published: |
Carleton University
2012-05-01
|
Series: | Journal of Computational Geometry |
Online Access: | http://jocg.org/index.php/jocg/article/view/78 |
Similar Items
-
Optimal Point Sets With Few Distinct Triangles
by: Depret-Guillaume, James Serge
Published: (2019) -
Creating triangle strips from clustered point sets
by: Jenke, Peter
Published: (2010) -
The Madison Triangle : there must be a point
by: Wright, Timothy M.
Published: (2011) -
Investigating Centers of Triangles: The Fermat Point
by: Strauss, Katherine E.
Published: (2011) -
Influence of colour on the consumer behaviour of Generation Y students in the Vaal Triangle / Re-an Muller
by: Müller, Re-an
Published: (2014)