test Browse by Author Names Browse by Titles of Works Browse by Subjects of Works Browse by Issue Dates of Works
       

Advanced Search
Home   
 
Browse   
Communities
& Collections
  
Issue Date   
Author   
Title   
Subject   
 
Sign on to:   
Receive email
updates
  
My Account
authorized users
  
Edit Profile   
 
Help   
About T-Space   

T-Space at The University of Toronto Libraries >
University of Toronto at Scarborough >
Computer and Mathematical Science >
Mathematics >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1807/9467

Title: Total coloring with Delta plus poly(log Delta) colors
Authors: Hind, H.
Molloy, M.
Reed, B.
Keywords: Delta colors
Total colouring
Issue Date: 1998
Publisher: SIAM
Citation: Hind H., Molloy M. and Reed B. Total coloring with Delta plus poly(log Delta) colors; Journal of Computing Vol. 28, 1998, 816-821
Abstract: We provide a polynomial time algorithm which finds a total coloring of any graph with maximum degree Delta, Delta sufficiently large, using at most Delta + 8 log(8) Delta colors. This improves the best previous upper bound on the total chromatic number of Delta + 18 Delta(1/3) log(3 Delta).
Description: permission granted by SIAM This repository falls under the rights granted to the author in the SIAM copyright transfer agreement
URI: http://hdl.handle.net/1807/9467
ISSN: 0097-5397
Appears in Collections:Mathematics

Files in This Item:

File Description SizeFormat
total colouring with delta poly colours.pdf198.84 kBAdobe PDF
View/Open

Items in T-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

uoft