Acyclic list 7‐coloring of planar graphs

O. V. Borodin, D. G. Fon‐Der Flaass, A.V. Kostochka, André Raspaud, Éric Sopena

Journal of Graph Theory · 2002 · 65 citations · 10 references

Concepts

Abstract

Abstract The acyclic list chromatic number of every planar graph is proved to be at most 7. © 2002 Wiley Periodicals, Inc. J Graph Theory 40: 83–90, 2002

References

10