The circular chromatic number of the Mycielskian of G(k)(d)

檔案

日期

1999-09-01

類型

期刊名稱

JOURNAL OF GRAPH THEORY

卷期與頁次

第 32 卷第 1 期,頁 63–71

ISSN

0364-9024

語言

英文

摘要

In a search for triangle-free graphs with arbitrarily large chromatic numbers, Mycielski developed a graph transformation that transforms a graph G into a new graph mu(G), we now call the Mycielskian of G, which has the same clique number as G and whose chromatic number equals chi(G) + 1. Chang, Huang, and Zhu [G. J. Chang, L. Huang, & X. Zhu, Discrete Math, to appear] have investigated circular chromatic numbers of Mycielskians for several classes of graphs. In this article, we study circular chromatic numbers of Mycielskians for another class of graphs G(k)(d). The main result is that chi(c)(mu(G(k)(d))) = chi(mu(G(k)(d))), which settles a problem raised in [G. J. Chang, L. Huang, & X. Zhu, Discrete Math, to appear, and X. Zhu, to appear]. As chi(c)(G(k)(d)) = k/d and chi(G(k)(d)) = [k/d], consequently, there exist graphs G such that chi(c)(G) is as close to chi(G) - 1 as you want, but chi(c)(mu(G)) = chi(mu(G)). (C) 1999 John Wiley & Sons, Inc.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Huang, L., & Chang, G. (1999). The circular chromatic number of the Mycielskian of G(k)(d). JOURNAL OF GRAPH THEORY, 32(1), 63–71. https://ir.lib.nycu.edu.tw/handle/11536/31105

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/31105