CLASSES OF CHROMATICALLY UNIQUE OR EQUIVALENT GRAPHS

Authors
BOROWIECKI M DRGASBURCHARDT E
Citation
M. Borowiecki et E. Drgasburchardt, CLASSES OF CHROMATICALLY UNIQUE OR EQUIVALENT GRAPHS, Discrete mathematics, 121(1-3), 1993, pp. 11-18
Citations number
9
Categorie Soggetti
Mathematics, Pure",Mathematics
Journal title
Discrete mathematics → ACNP
ISSN journal
0012365X
Volume
121
Issue
1-3
Year of publication
1993
Pages
11 - 18
Database
ISI
SICI code
0012-365X(1993)121:1-3<11:COCUOE>2.0.ZU;2-3
Abstract
We prove the chromatic uniqueness of some families of graphs by using a special function which is the difference between the size of the lin e graph and the number of triangles of a given graph. Moreover, this f unction can be helpful in finding graphs chromatically equivalent to a given graph. We give a few examples showing how to generate such clas ses of graphs by using this function.