Login / Signup
A bound on the chromatic number of graphs without certain induced subgraphs.
Stanley Wagon
Published in:
J. Comb. Theory, Ser. B (1980)
Keyphrases
</>
computational complexity
lower bound
small number
undirected graph