Entry Dutton:1981:NGC from compj1980.bib

Last update: Sat Jan 6 02:03:49 MST 2018                Valid HTML 3.2!

Index sections

Top | Symbols | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Dutton:1981:NGC,
  author =       "R. D. Dutton and R. C. Brigham",
  title =        "A New Graph Colouring Algorithm",
  journal =      j-COMP-J,
  volume =       "24",
  number =       "1",
  pages =        "85--86",
  month =        feb,
  year =         "1981",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/24.1.85",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  MRclass =      "68C05 (05-04 05C15 68E10)",
  MRnumber =     "82b:68025",
  bibdate =      "Tue Dec 4 14:48:09 MST 2012",
  bibsource =    "Compendex database;
                 http://comjnl.oxfordjournals.org/content/24/1.toc;
                 http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_24/Issue_01/",
  URL =          "http://comjnl.oxfordjournals.org/content/24/1/85.full.pdf+html;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_24/Issue_01/tiff/85.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_24/Issue_01/tiff/86.tif",
  acknowledgement = ack-nhfb,
  classcodes =   "C1160 (Combinatorial mathematics)",
  classification = "723",
  corpsource =   "Dept. of Computer Sci., Univ. of Central Florida,
                 Orlando, FL, USA",
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
  keywords =     "algorithm; computer programming; graph colouring;
                 heuristic polynomial time; multiple edge; no loop
                 edge",
  treatment =    "A Application; T Theoretical or Mathematical",
}

Related entries