Counterexamples against some families of chromatically unique graphs

Autor:	Zu Nian Li, Zhen Zhen Feng
Rok vydání:	2002
Předmět:	Combinatorics Discrete mathematics Discrete Mathematics and Combinatorics Mathematics Counterexample Theoretical Computer Science
Zdroj:	Discrete Mathematics. 243(1-3):257-258
ISSN:	0012-365X
DOI:	10.1016/s0012-365x(01)00203-5
Popis:	In this note, we show that there are some counterexamples against two families of chromatically unique graphs H 5 (j,k,l) and H 6 (p,q) given by Koh and Teo ([1],[2]).
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::612dfccff349949122c43802c4ef19b3 Zobrazit plný text záznamu Full Text from ScienceDirect