Portal de Periódicos da CAPES

Total colorings of planar graphs with large maximum degree

1997; Wiley; Volume: 26; Issue: 1 Linguagem: Inglês

10.1002/(sici)1097-0118(199709)26

1097-0118

O. V. Borodin, Alexandr Kostochka, Douglas R. Woodall,

Computational Geometry and Mesh Generation

It is proved that a planar graph with maximum degree Δ ≥ 11 has total (vertex-edge) chromatic number $Delta; + 1. © 1997 John Wiley & Sons, Inc. J Graph Theory 26: 53–59, 1997