Author:
EMDEN-WEINERT THOMAS,HOUGARDY STEFAN,KREUTER BERND
Abstract
For any integer k, we prove the existence of a uniquely
k-colourable graph of girth at least
g on at most k12(g+1) vertices whose
maximal degree
is at most 5k13. From this we deduce
that, unless NP=RP, no polynomial time algorithm for k-Colourability
on graphs G of girth
g(G)[ges ]log[mid ]G[mid ]/13logk
and
maximum degree Δ(G)[les ]6k13
can exist. We also study several related problems.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Cited by
52 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献