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.
[1] Richard J. Nowakowski,et al. On a class of isometric subgraphs of a graph , 1982, Comb..
[2] P. Hell. Absolute planar retracts and the four color conjecture , 1974 .
[3] Richard J. Nowakowski,et al. Fixed-edge theorem for graphs with loops , 1979, J. Graph Theory.