2000 character limit reached
The coloring problem for $\{P_5,\bar{P_5}\}$-free graphs and $\{P_5,K_p-e\}$-free graphs is polynomial
Published 9 Mar 2015 in cs.DM | (1503.02550v1)
Abstract: We show that determining the chromatic number of a ${P_5,\bar{P_5}}$-free graph or a ${P_5,K_p-e}$-free graph can be done in polynomial time
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.