On uniquely 3-colorable graphs
type: Item
instance of: scholarly article
title: On uniquely 3-colorable graphs
zbMATH Open document ID: 0780.05021
DOI: 10.1016/0012-365X(93)90220-N
author: Chong-Yun Chao
author: Zhibo Chen
published in: Discrete Mathematics
publication date: 1993-08-30T00:00:00Z
review text: The authors show: (1) For each integer \(m\geq 12\), there exists a uniquely 3-colourable graph of order \(m\) without triangles. (2) For each integer \(n\geq 3\), there exists infinitely many uniquely \(n\)-colourable regular graphs having no subgraph isomorphic to the complete graph \(K_ n\) on \(n\) vertices.
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 179585
zbMATH Keywords: uniquely 3-colourable graph
zbMATH Keywords: regular graphs
reviewed by: Jozef Fiamčík
MaRDI profile type: Publication
cites work: Uniquely colorable graphs
cites work: Parallel concepts in graph theory
cites work: An introduction to chromatic polynomials
description: scientific article; zbMATH DE number 179585