2000 character limit reached
Colouring stability two unit disk graphs
Published 30 Sep 2011 in math.CO | (1110.0037v1)
Abstract: We prove that every stability two unit disk graph has chromatic number at most 3/2 times its clique number.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.