Login / Signup
Grinstead's conjecture is true for graphs with a small clique number.
Kenji Kashiwabara
Tadashi Sakuma
Published in:
Discret. Math. (2006)
Keyphrases
</>
small number
data sets
computational complexity
maximum number
small fraction