Vernold Vivin
University College of Engineering Nagercoil

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

On star coloring of Mycielskians K. Kaliraj; V. Kowsalya; Vernold Vivin
Indonesian Journal of Combinatorics Vol 2, No 2 (2018)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (547.256 KB) | DOI: 10.19184/ijc.2018.2.2.3

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.