论mycielskian的星形着色

Indonesian Journal of Combinatorics Pub Date : 2018-12-21 DOI:10.19184/IJC.2018.2.2.3

K. Kaliraj, V. Kowsalya, Vernold Vivin

{"title":"论mycielskian的星形着色","authors":"K. Kaliraj, V. Kowsalya, Vernold Vivin","doi":"10.19184/IJC.2018.2.2.3","DOIUrl":null,"url":null,"abstract":"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 μ(G), we now call the Mycielskian of G, which has the same clique number as G and whose chromatic number equals χ(G) + 1. In this paper, we find the star chromatic number for the Mycielskian graph of complete graphs, paths, cycles and complete bipartite graphs.","PeriodicalId":13506,"journal":{"name":"Indonesian Journal of Combinatorics","volume":"91 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2018-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On star coloring of Mycielskians\",\"authors\":\"K. Kaliraj, V. Kowsalya, Vernold Vivin\",\"doi\":\"10.19184/IJC.2018.2.2.3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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 μ(G), we now call the Mycielskian of G, which has the same clique number as G and whose chromatic number equals χ(G) + 1. In this paper, we find the star chromatic number for the Mycielskian graph of complete graphs, paths, cycles and complete bipartite graphs.\",\"PeriodicalId\":13506,\"journal\":{\"name\":\"Indonesian Journal of Combinatorics\",\"volume\":\"91 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-12-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Indonesian Journal of Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.19184/IJC.2018.2.2.3\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Indonesian Journal of Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.19184/IJC.2018.2.2.3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

在寻找具有任意大色数的无三角形图时，Mycielski发展了一个图变换，将图G变换成一个新的图μ(G)，我们现在称之为G的Mycielskian，它与G具有相同的团数，其色数等于χ(G) + 1。本文给出了完全图、路径、环和完全二部图的Mycielskian图的星色数。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

On star coloring of Mycielskians

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 μ(G), we now call the Mycielskian of G, which has the same clique number as G and whose chromatic number equals χ(G) + 1. In this paper, we find the star chromatic number for the Mycielskian graph of complete graphs, paths, cycles and complete bipartite graphs.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Indonesian Journal of Combinatorics

自引率

0.00%

发文量

期刊最新文献

A note on vertex irregular total labeling of trees On Ramsey (mK2,bPn)-minimal Graphs Local Strong Rainbow Connection Number of Corona Product Between Cycle Graphs Γ-supermagic labeling of products of two cycles with cyclic groups On graphs associated to topological spaces