Skip Navigation

Journal of the London Mathematical Society 1999 60(2):333-343; doi:10.1112/S0024610799007668
© 1999 by London Mathematical Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Zhao, Y.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The London Mathematical Society

On the Total Coloring of Graphs Embeddable in Surfaces

Yue Zhao

Department of Mathematics and Computer Science, Benedict College Columbia, SC 29204-1086, USA zhao{at}math.ohio-state.edu

Received 28 May 1996.

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

Department of Mathematics, University of Central Florida, Orlando, FL 32816-1364, USA.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.