IMPROVED BOUNDS FOR THE CHROMATIC NUMBER OF THE LEXICOGRAPHIC PRODUCTOF GRAPHS

Authors
KASCHEK R KLAVZAR S
Citation
R. Kaschek et S. Klavzar, IMPROVED BOUNDS FOR THE CHROMATIC NUMBER OF THE LEXICOGRAPHIC PRODUCTOF GRAPHS, Indian Journal of Pure and Applied Mathematics, 25(12), 1994, pp. 1267-1274
Citations number
20
Categorie Soggetti
Mathematics, General",Mathematics
Journal title
Indian Journal of Pure and Applied Mathematics → ACNP
ISSN journal
00195588
Volume
25
Issue
12
Year of publication
1994
Pages
1267 - 1274
Database
ISI
SICI code
0019-5588(1994)25:12<1267:IBFTCN>2.0.ZU;2-M
Abstract
An upper bound for the chromatic number of the lexicographic product o f graphs is proved. It unifies and generalizes several known results a nd is in particular applied to characterize the graphs that have a com plete core. An improved lower bound is also given.