On uniquely 3-colorable graphs II

Chong Yun Chao, Zhibo Chen

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

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.

Original languageEnglish (US)
Pages (from-to)259-265
Number of pages7
JournalDiscrete Mathematics
Volume189
Issue number1-3
DOIs
StatePublished - Jul 28 1998

Fingerprint

Triangle-free
Integer
Connected graph
Graph in graph theory
Non-negative

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Cite this

Chao, Chong Yun ; Chen, Zhibo. / On uniquely 3-colorable graphs II. In: Discrete Mathematics. 1998 ; Vol. 189, No. 1-3. pp. 259-265.
@article{623c3833fc3a4300a3c5d20005fe56a3,
title = "On uniquely 3-colorable graphs II",
abstract = "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.",
author = "Chao, {Chong Yun} and Zhibo Chen",
year = "1998",
month = "7",
day = "28",
doi = "10.1016/S0012-365X(98)00056-9",
language = "English (US)",
volume = "189",
pages = "259--265",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1-3",

}

On uniquely 3-colorable graphs II. / Chao, Chong Yun; Chen, Zhibo.

In: Discrete Mathematics, Vol. 189, No. 1-3, 28.07.1998, p. 259-265.

Research output: Contribution to journalArticle

TY - JOUR

T1 - On uniquely 3-colorable graphs II

AU - Chao, Chong Yun

AU - Chen, Zhibo

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 -