ON THE PARTITION AND COLORING OF A GRAPH BY CLIQUES

Authors
WALLIS WD ZHANG GH
Citation
Wd. Wallis et Gh. Zhang, ON THE PARTITION AND COLORING OF A GRAPH BY CLIQUES, Discrete mathematics, 120(1-3), 1993, pp. 191-203
Citations number
17
Categorie Soggetti
Mathematics, Pure",Mathematics
Journal title
Discrete mathematics → ACNP
ISSN journal
0012365X
Volume
120
Issue
1-3
Year of publication
1993
Pages
191 - 203
Database
ISI
SICI code
0012-365X(1993)120:1-3<191:OTPACO>2.0.ZU;2-F
Abstract
We first introduce the concept of the k-chromatic index of a graph, an d then discuss some of its properties. A characterization of the cliqu e partition number of the graph G OR K(m)c for any simple graph G is g iven, together with some of its applications. Graphs with maximum vale ncy 3 are also considered.