Indonesian Journal of Combinatorics
Vol 2, No 2 (2018)

On star coloring of Mycielskians

K. Kaliraj (University of Madras)
V. Kowsalya (Bharathiar University)
Vernold Vivin (University College of Engineering Nagercoil)

Article Info

Publish Date
21 Dec 2018

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.

Copyrights © 2018




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Full PDF
547.256 KB
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
Indonesian Journal of Combinatorics
Website

Abbrev

ijc

Publisher

Indonesian Combinatorial Society

Subject

Computer Science & IT Decision Sciences, Operations Research & Management

Description

Indonesian Journal of Combinatorics (IJC) publishes current research articles in any area of combinatorics and graph theory such as graph labelings, optimal network problems, metric dimension, graph coloring, rainbow connection and other related topics. IJC is published by the Indonesian ...