Please use this identifier to cite or link to this item:
|Title:||On chromatic uniqueness of uniform subdivisions of graphs||Authors:||Teo, C.P.
|Issue Date:||1994||Citation:||Teo, C.P.,Koh, K.M. (1994). On chromatic uniqueness of uniform subdivisions of graphs. Discrete Mathematics 128 (1-3) : 327-335. ScholarBank@NUS Repository.||Abstract:||Let σk(G) denote the number of cycles of length k in a graph G. In this paper, we first prove that if G and H are χ-equivalent graphs, then σk(G) = σk(H) for all k with g≤k≤ 3 2g - 2, w ere g is the girth of G. This result will then be incorporated with a structural theorem obtained in  to show that all uniform subdivisions of some families of graphs, including the complete bipartite graphs and certain cages, are χ-unique. © 1994.||Source Title:||Discrete Mathematics||URI:||http://scholarbank.nus.edu.sg/handle/10635/45057||ISSN:||0012365X|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.