<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>01092969</id>
  <dt>j</dt>
  <an>01092969</an>
  <augroup>
    <au>Khairat, M.K.</au>
    <au>El-Zahar, M.H.</au>
    <au>Bahig, H.M.</au>
  </augroup>
  <ti>An exact graph coloring algorithm using color exchange.</ti>
  <so>J. Egypt. Math. Soc. 5, No.1, 65-71 (1997).</so>
  <py>1997</py>
  <pu>Egyptian Mathematical Society, Cairo; Elsevier, Amsterdam</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>chromatic number</ut>
    <ut>coloring</ut>
    <ut>algorithm</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
  </ligroup>
  <abgroup>
    <ab>The authors apply a method based on a theorem of Berge and give an algorithm for coloring the vertices of a graph. The original Berge algorithm, a modified version of it, and a simple branch-and-bound backtracking algorithm are executed on PC AT 486 computer to produce an exact coloring function. The authors' implementation has the merit that it does not require a large amount of memory.</ab>
    <rv>J.Fiam\v{c}ik (Pre\v{s}ov)</rv>
  </abgroup>
</item>