TY - JOUR

T1 - On uniquely 3-colorable graphs II

AU - Chao, Chong Yun

AU - Chen, Zhibo

N1 - Funding Information:
* Corresponding author. ’ The research is supported in part by a RDG grant of the Pennsylvania State University.

PY - 1998/7/28

Y1 - 1998/7/28

N2 - In [2], for each non-negative integer k, we constructed a connected graph with (24)2k vertices which is uniquely 3-colorable, regular with degree k+5, and triangle-free. Here, for each positive integer n and each integer r≥5, we construct a connected graph with (26)n·2r-5 vertices which is uniquely 3-colorahle, regular with degree r, and triangle-free.

AB - In [2], for each non-negative integer k, we constructed a connected graph with (24)2k vertices which is uniquely 3-colorable, regular with degree k+5, and triangle-free. Here, for each positive integer n and each integer r≥5, we construct a connected graph with (26)n·2r-5 vertices which is uniquely 3-colorahle, regular with degree r, and triangle-free.

UR - http://www.scopus.com/inward/record.url?scp=0042785369&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0042785369&partnerID=8YFLogxK

U2 - 10.1016/S0012-365X(98)00056-9

DO - 10.1016/S0012-365X(98)00056-9

M3 - Article

AN - SCOPUS:0042785369

VL - 189

SP - 259

EP - 265

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-3

ER -