On uniquely 3-colorable graphs II

Chong Yun Chao; Zhibo Chen

doi:10.1016/S0012-365X(98)00056-9

On uniquely 3-colorable graphs II

Chong Yun Chao
, Zhibo Chen

Penn State Greater Allegheny

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

Abstract

In [2], for each non-negative integer k, we constructed a connected graph with (24)2^k 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·2^r-5 vertices which is uniquely 3-colorahle, regular with degree r, and triangle-free.

Original language	English (US)
Pages (from-to)	259-265
Number of pages	7
Journal	Discrete Mathematics
Volume	189
Issue number	1-3
DOIs	https://doi.org/10.1016/S0012-365X(98)00056-9
State	Published - Jul 28 1998

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

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

Cite this

@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",

note = "Funding Information: * Corresponding author. {\textquoteright} The research is supported in part by a RDG grant of the Pennsylvania State University.",

year = "1998",

month = jul,

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 B.V.",

number = "1-3",

}

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 - https://www.scopus.com/pages/publications/0042785369

UR - https://www.scopus.com/pages/publications/0042785369#tab=citedBy

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

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

M3 - Article

AN - SCOPUS:0042785369

SN - 0012-365X

VL - 189

SP - 259

EP - 265

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1-3

ER -

On uniquely 3-colorable graphs II

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this