Title

On The Total Coloring Of Graphs Embeddable In Surfaces

Abstract

The paper shows that any graph G with the maximum degree Δ(G) ≥ 8, which is embeddable in a surface Σ of Euler characteristic χ(Σ) ≥ 0, is totally (Σ(G)+2)-colorable. In general, it is shown that any graph G which is embeddable in a surface Σ and satisfies the maximum degree Δ(G) ≥ (20/9) (3-χ(Σ))+1 is totally (Δ(G)+2)-colorable.

Publication Date

1-1-1999

Publication Title

Journal of the London Mathematical Society

Volume

60

Issue

2

Number of Pages

333-343

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1112/S0024610799007668

Socpus ID

0040036753 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/0040036753

This document is currently not available here.

Share

COinS