论文信息 - An acyclic analogue to Heawood's theorem - 字舞流文

An acyclic analogue to Heawood's theorem

M. Albertson | D. M. Berman

[1] R. L. Brooks. On Colouring the Nodes of a Network , 1941 .

[2] B. Grünbaum. Acyclic colorings of planar graphs , 1973 .

[3] J. Mitchem. Every planar graph has an acyclic $8$-coloring , 1974 .

[4] M. Albertson,et al. Every planar graph has an acyclic 7-coloring , 1977 .