Last update: Thu Sep 27 02:46:57 MDT 2018
@Article{Edwards:1986:CCP,
author = "K. Edwards",
title = "The complexity of colouring problems on dense graphs",
journal = j-THEOR-COMP-SCI,
volume = "43",
number = "2--3",
pages = "337--343",
month = "????",
year = "1986",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Math. Inst., Oxford Univ., UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "colouring problems; computational complexity; dense
graphs; deterministic polynomial time algorithm;
enumeration problems; graph colouring; vertex
k-colouring",
pubcountry = "Netherlands A13",
treatment = "T Theoretical or Mathematical",
}