A note on the incidence coloring of outerplanar graphs

Loading...
Thumbnail Image

Date

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

A proof that every outerplanar graph is Δ+2 colorable. This is slightly stronger then an unpublished result of Wang Shudong, Ma Fangfang, Xu Jin, and Yan Lijun proving the same for 2-connected outerplanar graphs.
added reference to bounds for planar and higher genus graphs

Citation

Consulte el texto completo en el siguiente enlace:

Collections