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

Title: Chromatic neighborhood sets
Authors: Molloy, M.
Keywords: Chromatic number
Fajtlowicz
Issue Date: 1999
Publisher: John Wiley & Sons, Inc.
Citation: Molloy,M.(1999).Chromatic neighborhood sets.Journal of Graph Theory. 31(4), 303-311
Abstract: For each vertex υ in a graph G, we denote by χυ the chromatic number of the subgraph induced by its neighborhood, and we set χN(G) = {χυ: υ ∈ V(G)}. We characterize those sets X for which there exists some G of prescribed size with X = χN(G), and prove a related conjecture of Fajtlowicz. We also discuss those graphs that are extremal with respect to χN(G).
Description: “This is a preprint of an article accepted for publication in [Journal of Graph Theory]  copyright (1999) John Wiley & Sons, Inc.
URI: http://hdl.handle.net/1807/9524
ISSN: 0364-9024
Appears in Collections:Mathematics

Files in This Item:

File Description SizeFormat
chromatic neighbourhoods.pdf177.66 kBAdobe PDF
View/Open

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

uoft