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/9474

Title: A Bound on the Strong Chromatic Index of a Graph
Authors: Molloy, M.
Reed, B.
Keywords: chromatic index of a graph
Issue Date: Mar-1997
Publisher: Elsevier
Citation: Molloy, M., Reed, B. A bound on the strong chromatic index of a graph. J. Combin. Theory Ser. B 69 (1997), no. 2, 103-109
Abstract: We show that the strong chromatic index of a graph with maximum degreeΔ; is at most (2−ɛ)Δ2, for someɛ>0. This answers a question of Erdős and Nešetřil.
Description: The author can archive pre-print, post-print of the article, approporiate journal homepage link is attached.
URI: http://hdl.handle.net/1807/9474
ISSN: 0095-8956
Appears in Collections:Mathematics

Files in This Item:

File Description SizeFormat
strong chromatic index of a graph.pdf189.75 kBAdobe PDF
View/Open

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

uoft