A characterization of absolute retracts of n-chromatic graphs

Abstract A recursive characterization of the absolute retracts in the class of n -chromatic (connected) graphs is given.