BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-72-273
       ENTRY:: October 16, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Chromatic automorphisms of graphs.
        TYPE:: Technical Report
      AUTHOR:: Chvatal, Vaclav
      AUTHOR:: Sichler, Jiri
        DATE:: March 1972
       PAGES:: 13
    ABSTRACT:: The coloring group and the full automorphism group of an
               n-chromatic graph are independent if and only if n is an
               integer $\geq$ 3.
       NOTES:: [Adminitrivia V1/Prg/19951016]
         END:: STAN//CS-TR-72-273