# Uniquely $n$-colorable and chromatically equivalent graphs.

Bulletin of the Malaysian Mathematical Sciences Society. Second Series (2001)

- Volume: 24, Issue: 1, page 93-103
- ISSN: 0126-6705

## Access Full Article

top## How to cite

topChao, Chong-Yun. "Uniquely -colorable and chromatically equivalent graphs.." Bulletin of the Malaysian Mathematical Sciences Society. Second Series 24.1 (2001): 93-103. <http://eudml.org/doc/49854>.

@article{Chao2001,

author = {Chao, Chong-Yun},

journal = {Bulletin of the Malaysian Mathematical Sciences Society. Second Series},

keywords = {uniquely colorable graph; chromatically equivalent graphs; chromatic polynomial; complement of a graph; complete graph; clique cover},

language = {eng},

number = {1},

pages = {93-103},

publisher = {Malaysian Mathematical Sciences Society, Bangi},

title = {Uniquely -colorable and chromatically equivalent graphs.},

url = {http://eudml.org/doc/49854},

volume = {24},

year = {2001},

}

TY - JOUR

AU - Chao, Chong-Yun

TI - Uniquely -colorable and chromatically equivalent graphs.

JO - Bulletin of the Malaysian Mathematical Sciences Society. Second Series

PY - 2001

PB - Malaysian Mathematical Sciences Society, Bangi

VL - 24

IS - 1

SP - 93

EP - 103

LA - eng

KW - uniquely colorable graph; chromatically equivalent graphs; chromatic polynomial; complement of a graph; complete graph; clique cover

UR - http://eudml.org/doc/49854

ER -

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.