On star coloring of Mycielskians
Indonesian Journal of Combinatorics · 2018
DOI: 10.19184/ijc.2018.2.2.3 ↗Kurz gefasst
Fachartikel in der Zeitschrift Indonesian Journal of Combinatorics, 2018. Verfasst von K. Kaliraj und 2 weiteren Autor:innen.
Abstract (Originalsprache)
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.
Zitieren
APA
Kaliraj, K., Kowsalya, V., & Vivin, V. (2018). On star coloring of Mycielskians. Indonesian Journal of Combinatorics. https://doi.org/10.19184/ijc.2018.2.2.3
Vancouver
Kaliraj K, Kowsalya V, Vivin V. On star coloring of Mycielskians. Indonesian Journal of Combinatorics. 2018. doi:10.19184/ijc.2018.2.2.3
BibTeX
@article{Kaliraj2018,
author = {Kaliraj, K. and Kowsalya, V. and Vivin, Vernold},
title = {On star coloring of Mycielskians},
journal = {Indonesian Journal of Combinatorics},
year = {2018},
doi = {10.19184/ijc.2018.2.2.3}
}
EUVIMED